Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783350
A. Haider, A. Nakao
This paper investigates the stability characteristics of overlay networks performing switching between multiple virtual paths. A global stability condition for switched-control-systems has been applied to overlay path switching frequency, that can be incorporated into design of better routing protocols for overlay networks. Further, NS-2 based simulations have been carried out on an overlay network to evaluate the impact of round-trip-time, packet loss probability and throughput metrics on decisions regarding path selection. Throughput based switching decisions have shown to be resulting in lower number of path changes, which is desirable. Also, it has been observed that delay and loss based metrics can result into a large number of frequent path changes, which can push the overlay routing system into an instable oscillating state for a prolonged period of time.
{"title":"On Path Switching in Overlay Networks","authors":"A. Haider, A. Nakao","doi":"10.1109/ATNAC.2008.4783350","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783350","url":null,"abstract":"This paper investigates the stability characteristics of overlay networks performing switching between multiple virtual paths. A global stability condition for switched-control-systems has been applied to overlay path switching frequency, that can be incorporated into design of better routing protocols for overlay networks. Further, NS-2 based simulations have been carried out on an overlay network to evaluate the impact of round-trip-time, packet loss probability and throughput metrics on decisions regarding path selection. Throughput based switching decisions have shown to be resulting in lower number of path changes, which is desirable. Also, it has been observed that delay and loss based metrics can result into a large number of frequent path changes, which can push the overlay routing system into an instable oscillating state for a prolonged period of time.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129260886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783290
M. Scheidegger, T. Braun, B. Zahler
Distance estimation services support the adaptivity of distributed applications on the Internet by predicting the network characteristics between end systems. A common problem of such services is their need for large-scale deployment in order to operate properly. We propose a peer-to-peer-based distance measurement and prediction service that is able to predict distances from a single site to arbitrary end systems on the Internet while only requiring deployment at this specific site. In this paper we present the service architecture, and we demonstrate the viability of the approach with results from a prototype deployment of the service.
{"title":"An Internet Distance Prediction Service based on Passive Measurements","authors":"M. Scheidegger, T. Braun, B. Zahler","doi":"10.1109/ATNAC.2008.4783290","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783290","url":null,"abstract":"Distance estimation services support the adaptivity of distributed applications on the Internet by predicting the network characteristics between end systems. A common problem of such services is their need for large-scale deployment in order to operate properly. We propose a peer-to-peer-based distance measurement and prediction service that is able to predict distances from a single site to arbitrary end systems on the Internet while only requiring deployment at this specific site. In this paper we present the service architecture, and we demonstrate the viability of the approach with results from a prototype deployment of the service.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":"25 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122864472","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783307
Toshinori Takabatake
As technologies of computer network have been advanced, appliances as well as personal computers being networked together in the home have been connected to the Internet. However, the number of IP addresses in IPv4 is estimated to be not enough in the near future. IPv4 has been thus switched with IPv6. Meanwhile, Network Address Translator (for short, NAT) has been used for solving the lack of the IP addresses. On the other hand, since a communication from the Internet to the private or home networks in NAT is difficult, many NAT traversal techniques have been developed as the solution. One of the NAT traversal techniques is that of "relaying". However, the relaying techniques have a drawback such that the relay server can be overloaded according to an increase in the number of communications. In this paper, as NAT traversal in a home gateway which is connected the home to the Internet, a scheme to balance the load by several relay servers and by a surveillance one is presented and two relay server selection methods are proposed. The proposed methods are a random selection and a priority-based one. Simulation results show that the load makes it possible to balance well in inverse proportion to the relay servers by the proposed methods.
{"title":"A Scheme of Relay Server Selection Methods for NAT Traversal through Home Gateways","authors":"Toshinori Takabatake","doi":"10.1109/ATNAC.2008.4783307","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783307","url":null,"abstract":"As technologies of computer network have been advanced, appliances as well as personal computers being networked together in the home have been connected to the Internet. However, the number of IP addresses in IPv4 is estimated to be not enough in the near future. IPv4 has been thus switched with IPv6. Meanwhile, Network Address Translator (for short, NAT) has been used for solving the lack of the IP addresses. On the other hand, since a communication from the Internet to the private or home networks in NAT is difficult, many NAT traversal techniques have been developed as the solution. One of the NAT traversal techniques is that of \"relaying\". However, the relaying techniques have a drawback such that the relay server can be overloaded according to an increase in the number of communications. In this paper, as NAT traversal in a home gateway which is connected the home to the Internet, a scheme to balance the load by several relay servers and by a surveillance one is presented and two relay server selection methods are proposed. The proposed methods are a random selection and a priority-based one. Simulation results show that the load makes it possible to balance well in inverse proportion to the relay servers by the proposed methods.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125988074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783298
Jin-Hyuk Song, Jee-Hoon Kim, Jung-In Baik, Hyoung-Kyu Song
Cyclic delay diversity (CDD) was introduced to obtain spatial diversity in multi-input multi-output (MIMO) system. In practice, terminals are difficult to have multiple antennas due to high cost or limited size. Accordingly, the cooperative scheme has recently emerged and given considerable attention. In this paper, CDD is incorporated into the wireless cooperative communication system, in which each terminal has single antenna. The proposed cooperative CDD scheme is compared with cooperative orthogonal space time block code (STBC). Cooperative CDD attains generally worse performance than cooperative STBC from orthogonal design, but cooperative CDD can be easily applied with an arbitrary number of relays and do not require additional complexity at both transmitter and receiver.
{"title":"A Simple Cooperative Cyclic Delay Diversity in Wireless Networks","authors":"Jin-Hyuk Song, Jee-Hoon Kim, Jung-In Baik, Hyoung-Kyu Song","doi":"10.1109/ATNAC.2008.4783298","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783298","url":null,"abstract":"Cyclic delay diversity (CDD) was introduced to obtain spatial diversity in multi-input multi-output (MIMO) system. In practice, terminals are difficult to have multiple antennas due to high cost or limited size. Accordingly, the cooperative scheme has recently emerged and given considerable attention. In this paper, CDD is incorporated into the wireless cooperative communication system, in which each terminal has single antenna. The proposed cooperative CDD scheme is compared with cooperative orthogonal space time block code (STBC). Cooperative CDD attains generally worse performance than cooperative STBC from orthogonal design, but cooperative CDD can be easily applied with an arbitrary number of relays and do not require additional complexity at both transmitter and receiver.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121908021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783310
Jung-In Baik, Jee-Hoon Kim, Jin-Hyuk Song, Hyoung-Kyu Song
Orthogonal frequency and code division (OFCDM) provides a good performance on broadband or wide-band channel, because it can mitigate multi-path interference with keeping high data rate. So, this scheme is suitable to employ the future wireless communication system. And, Cooperative relaying scheme has been proposed to get the spatial diversity gains in multiuser wireless systems. Because, this scheme need no multiple antenna, it makes devices with low cost and small size. In this paper, we proposed the cooperative relaying scheme based on OFCDM. This system has profit of OFCDM and cooperative relaying schemes. It is also not much more complex than the single antenna OFCDM system. This scheme is appropriate to the next generation mobile wireless system, because of having both advantages. The performance of the proposed scheme is evaluated in terms of bit error rate (BER) performance for the OFCDM in the UWB channel.
{"title":"Performance Improvement of Cooperative Relaying Scheme Based on OFCDM in UWB Channel","authors":"Jung-In Baik, Jee-Hoon Kim, Jin-Hyuk Song, Hyoung-Kyu Song","doi":"10.1109/ATNAC.2008.4783310","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783310","url":null,"abstract":"Orthogonal frequency and code division (OFCDM) provides a good performance on broadband or wide-band channel, because it can mitigate multi-path interference with keeping high data rate. So, this scheme is suitable to employ the future wireless communication system. And, Cooperative relaying scheme has been proposed to get the spatial diversity gains in multiuser wireless systems. Because, this scheme need no multiple antenna, it makes devices with low cost and small size. In this paper, we proposed the cooperative relaying scheme based on OFCDM. This system has profit of OFCDM and cooperative relaying schemes. It is also not much more complex than the single antenna OFCDM system. This scheme is appropriate to the next generation mobile wireless system, because of having both advantages. The performance of the proposed scheme is evaluated in terms of bit error rate (BER) performance for the OFCDM in the UWB channel.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":"234 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115827148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783288
M. Sqalli, S. M. Sait, S. Asadullah
Efficient network utilization using available resources is the main goal of traffic engineering and routing is the core criteria which regulates traffic over Internet links. Open Shortest Path First (OSPF) is a routing protocol which is widely used in the industry and uses the link weights as its routing metric. Optimizing these link weights leads to efficient routing and better network utilization. Setting weights on links for given traffic demands such that congestion can be avoided is an NP-hard problem. In this paper, tabu search, a non-deterministic iterative heuristic is applied to this problem using two different cost functions proposed in the literature. Moreover, we present the results for two additional performance metrics viz. number of congested links and percentage of extra load. This provides the network designer with more flexibility to optimize desired parameters based on the requirements. Our results show superior performance of tabu search over other heuristics.
{"title":"Minimizing the Number of Congested Links in OSPF Routing","authors":"M. Sqalli, S. M. Sait, S. Asadullah","doi":"10.1109/ATNAC.2008.4783288","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783288","url":null,"abstract":"Efficient network utilization using available resources is the main goal of traffic engineering and routing is the core criteria which regulates traffic over Internet links. Open Shortest Path First (OSPF) is a routing protocol which is widely used in the industry and uses the link weights as its routing metric. Optimizing these link weights leads to efficient routing and better network utilization. Setting weights on links for given traffic demands such that congestion can be avoided is an NP-hard problem. In this paper, tabu search, a non-deterministic iterative heuristic is applied to this problem using two different cost functions proposed in the literature. Moreover, we present the results for two additional performance metrics viz. number of congested links and percentage of extra load. This provides the network designer with more flexibility to optimize desired parameters based on the requirements. Our results show superior performance of tabu search over other heuristics.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131551420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783351
Q. D. Bui, A. Jennings
Multipath overlay routing technologies are seen as alternative solutions for VoIP because they inherit path diversity from peer-to-peer overlay networks. We discuss and compare the performances of two relay path selection approaches proposed for VoIP overlay systems through extensive simulations. We propose a new method for relay path computation that takes into account both path disjointness and other network quality factors (such as packet delay or loss). We further apply our method in different overlay network scenarios by varying the supernode distribution. It is found that there is a considerable improvement of path performance when relaying traffic through highly connected ASs using the new method.
{"title":"Relay Path Selection Approaches in Peer-to-Peer VoIP Systems","authors":"Q. D. Bui, A. Jennings","doi":"10.1109/ATNAC.2008.4783351","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783351","url":null,"abstract":"Multipath overlay routing technologies are seen as alternative solutions for VoIP because they inherit path diversity from peer-to-peer overlay networks. We discuss and compare the performances of two relay path selection approaches proposed for VoIP overlay systems through extensive simulations. We propose a new method for relay path computation that takes into account both path disjointness and other network quality factors (such as packet delay or loss). We further apply our method in different overlay network scenarios by varying the supernode distribution. It is found that there is a considerable improvement of path performance when relaying traffic through highly connected ASs using the new method.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129666118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783308
Jung-Suk Han, Jin-Woo Song, Taek-Hun Kim, Song-Bong Yang
As the mobile technology advances, various mobile peer-to-peer (P2P) systems have been developed. Since mobile devices have limited energy capacity, efficient use of the energy is indispensable for mobile P2P systems. In this paper, we propose an energy-efficient P2P system that is a type of the double-layered P2P systems in which files are searched mainly through the peers in the upper level, called super peers. The proposed system selects greedily the peers with more energy as super peers. The peers in the proposed system can identify themselves as super peers or sub-peers autonomously in a decentralized manner. We also propose three energy-efficient routing schemes, each of which is incorporated with the proposed system individually. The first routing scheme tries to utilize the energy of the peers on the routes more evenly, the second scheme chooses a route with the `strongest' peer among the peers each of which is the `weakest' peer on a route, and the last scheme selects a route with the second scheme among the routes with the smallest number of hops. Note that a routing scheme is applied each time when a route between a pair of super peers is chosen during the message transmission. Functionality and performances were evaluated through various experiments, and the results showed that the proposed P2P system with the third routing scheme improved the average network lifetimes by 368% and 22% over the double-layered and the proposed systems without applying any proposed scheme, respectively.
{"title":"Double-layered Mobile P2P Systems Using Energy-Efficient Routing Schemes","authors":"Jung-Suk Han, Jin-Woo Song, Taek-Hun Kim, Song-Bong Yang","doi":"10.1109/ATNAC.2008.4783308","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783308","url":null,"abstract":"As the mobile technology advances, various mobile peer-to-peer (P2P) systems have been developed. Since mobile devices have limited energy capacity, efficient use of the energy is indispensable for mobile P2P systems. In this paper, we propose an energy-efficient P2P system that is a type of the double-layered P2P systems in which files are searched mainly through the peers in the upper level, called super peers. The proposed system selects greedily the peers with more energy as super peers. The peers in the proposed system can identify themselves as super peers or sub-peers autonomously in a decentralized manner. We also propose three energy-efficient routing schemes, each of which is incorporated with the proposed system individually. The first routing scheme tries to utilize the energy of the peers on the routes more evenly, the second scheme chooses a route with the `strongest' peer among the peers each of which is the `weakest' peer on a route, and the last scheme selects a route with the second scheme among the routes with the smallest number of hops. Note that a routing scheme is applied each time when a route between a pair of super peers is chosen during the message transmission. Functionality and performances were evaluated through various experiments, and the results showed that the proposed P2P system with the third routing scheme improved the average network lifetimes by 368% and 22% over the double-layered and the proposed systems without applying any proposed scheme, respectively.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134581203","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783322
R. Hunjet
There is great interest in using mobile adhoc networks (MANETs) for military and civilian applications. There are still a lot of interesting problems investigating the capacity and the optimal design of these networks. This paper looks at one of these outstanding problems. Specifically the problem addressed is to determine how the capacity of a MANET can be increased by the optimal placement of an additional dynamic node in a power efficient manner. This node is envisaged to be a platform whose primary purpose is to increase the capacity and power efficiency of the MANET. Given a specific network configuration the optimal location of an additional node is investigated. This node insertion is teamed with power adjustments of all the nodes carried out in a manner consistent with topology control. This approach is then compared to topology control methods not using an additional node. The simulations performed show that the technique described can significantly decrease the jamming experienced within a MANET, thereby increasing the network's capacity. Additional benefit is also observed in the power usage of the MANET falling, thereby increasing the operational lifetime of the network. From the results obtained it will be inferred that a simple distributed algorithm to find the optimal point is not a trivial exercise.
{"title":"Power and Placement: Increasing Mobile Adhoc Network Capacity and Power Efficiency","authors":"R. Hunjet","doi":"10.1109/ATNAC.2008.4783322","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783322","url":null,"abstract":"There is great interest in using mobile adhoc networks (MANETs) for military and civilian applications. There are still a lot of interesting problems investigating the capacity and the optimal design of these networks. This paper looks at one of these outstanding problems. Specifically the problem addressed is to determine how the capacity of a MANET can be increased by the optimal placement of an additional dynamic node in a power efficient manner. This node is envisaged to be a platform whose primary purpose is to increase the capacity and power efficiency of the MANET. Given a specific network configuration the optimal location of an additional node is investigated. This node insertion is teamed with power adjustments of all the nodes carried out in a manner consistent with topology control. This approach is then compared to topology control methods not using an additional node. The simulations performed show that the technique described can significantly decrease the jamming experienced within a MANET, thereby increasing the network's capacity. Additional benefit is also observed in the power usage of the MANET falling, thereby increasing the operational lifetime of the network. From the results obtained it will be inferred that a simple distributed algorithm to find the optimal point is not a trivial exercise.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134615313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783328
Sunit Kumar Ghosh, M. Ryan, M. Frater
Localization has received considerable attention because many wireless sensor network applications require accurate knowledge of the locations of the sensors in the network. The two main localization techniques are distance measurement and angle-of-arrival measurement. The former requires extensive calculations to resolve sign ambiguities in calculated angles, while the latter requires careful calibration to provide high accuracy. In this paper, we describe a hybrid technique, in which low-accuracy estimates of the angle-of-arrival are used to resolve the sign ambiguity in distance measurements. In many practical situations, the ambiguity can be resolved with a high probability of success even with an RMS error as high as 30 degrees in the line-of-bearing estimate, which avoids the need for calibration. Early resolution of this sign ambiguity can be used to develop lower-complexity localization techniques using distance measurement.
{"title":"A Hybrid Distance-measurement/Angle-of-arrival Approach to Localization","authors":"Sunit Kumar Ghosh, M. Ryan, M. Frater","doi":"10.1109/ATNAC.2008.4783328","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783328","url":null,"abstract":"Localization has received considerable attention because many wireless sensor network applications require accurate knowledge of the locations of the sensors in the network. The two main localization techniques are distance measurement and angle-of-arrival measurement. The former requires extensive calculations to resolve sign ambiguities in calculated angles, while the latter requires careful calibration to provide high accuracy. In this paper, we describe a hybrid technique, in which low-accuracy estimates of the angle-of-arrival are used to resolve the sign ambiguity in distance measurements. In many practical situations, the ambiguity can be resolved with a high probability of success even with an RMS error as high as 30 degrees in the line-of-bearing estimate, which avoids the need for calibration. Early resolution of this sign ambiguity can be used to develop lower-complexity localization techniques using distance measurement.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132170300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：