{"title":"Fast connection recovery in WLAN-to-cellular vertical handoff","authors":"S. V. Azhari, T. D. Todd","doi":"10.1109/MAHSS.2005.1542787","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542787","url":null,"abstract":"Wireless LAN-to-cellular vertical handoff involves time consuming procedures that may significantly disrupt real-time communication. This situation is compounded by the fact that WLAN coverage may sometimes be lost very abruptly and without warning. In this paper we propose and investigate the use of a vertical handoff support node (VHSN), which is attached locally to the wired LAN hotspot infrastructure. Unlike proxy forwarding and wireless multi-hop schemes, the VHSN does not extend wireless coverage or perform infrastructure-based packet forwarding. The VHSN also does not communicate directly with any mobile station. Instead the VHSN functions as both an (Ethernet) LAN and cellular end station. When abrupt loss of WLAN coverage occurs, the VHSN quickly intercepts and redirects the media flow through the local cellular basestation using its cellular end station attachment. This action can quickly recover the connection before the remaining vertical handoff is executed. There are a number of key advantages that this mechanism has over existing forwarding/relaying techniques. Results will be presented which show the performance improvements, which are possible using this approach","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114472590","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}
{"title":"AASC: adaptive avoid second-collision backoff algorithm for multihop wireless sensor networks","authors":"C. Na, Tingxian Zhou, Lihong Li, K. Wang","doi":"10.1109/MAHSS.2005.1542767","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542767","url":null,"abstract":"Multihop is the main communication style for wireless sensor networks. MAC protocol has great impact on performance of network. CSMA-CA's backoff algorithm specification in the IEEE 802.15.4 standard cannot adapt to dynamic network and multihop communication. This paper proposes a strategy that relays data should have priority. This strategy guarantees that remote node's packets are transmitted reliably to destination node, whether network is burst flow or non-burst flow. A new backoff algorithm that can adapt to flow and avoid second-collision is proposed and analyzed in this paper. The paper models the networking using the theory of discrete tune Markov chains. Numerical results and OPNET simulation show that the new algorithm can adapt to burst flow better and produces throughput improvements, whether the number of node is large or small. Simulation results also show that the new algorithm relays more remote node's packets to destination node and saves energy through reducing retransmission in multihop networks","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121789713","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}
T. Chin, P. Ramanathan, K. Saluja, Kuang-Ching Wang
{"title":"Exposure for collaborative detection using mobile sensor networks","authors":"T. Chin, P. Ramanathan, K. Saluja, Kuang-Ching Wang","doi":"10.1109/MAHSS.2005.1542866","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542866","url":null,"abstract":"Sensor networks possess the inherent potential to detect the presence of a target in a monitored region. Although a stationary sensor network is often adequate to meet application requirements, it is not suited to many situations, for example, a huge number of nodes are required to monitor a large region. In such situations, mobile sensor networks can be used to resolve the communication and sensing coverage problems. This paper addresses the problem of detecting a target using mobile sensor networks. One of the fundamental issues in target detection problems is exposure, which measures how the region is covered by the sensor network. While traditional studies focus on stationary sensor networks, this paper formally defines and evaluates exposure in mobile sensor networks with the presence of obstacles and noise. To conform with practical situations, detection is conducted without presuming the target's activities and moving directions. As there is no fixed layout of node positions, a time expansion technique is developed to evaluate exposure. Since determining exposure can be computationally expensive, algorithms to calculate the upper and lower bounds on exposure are developed. Simulation results are also presented to illustrate the effectiveness of the algorithms","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124258478","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}
{"title":"Node localization using received signal statistics","authors":"Prachee Sharma, S. Tripathi","doi":"10.1109/MAHSS.2005.1542791","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542791","url":null,"abstract":"This work presents an analytical approach for determining the relative coordinates of a receiver with respect to the source node. The source is assumed to be location aware. Statistics of the received signal are used to estimate the orientation and distance of the receiver with respect to the source. The received signal power is used as a distance estimator and the orientation is determined using the inphase and quadrature components of the received signal. The proposed method is applicable only in presence of line-of-sight path","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129700436","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}
{"title":"Enforcing security for prevention of DoS attack in wireless sensor networks using economical modeling","authors":"A. Agah, K. Basu, Sajal K. Das","doi":"10.1109/MAHSS.2005.1542840","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542840","url":null,"abstract":"This paper focuses on the assessment of the properties of security enforcement mechanisms for prevention of denial of service (DoS) attacks in wireless sensor networks. First part of the paper demonstrates the requirement for security enforcement using auction theory that allows detection of non cooperative nodes. In the proposed protocol, nodes prefer to participate in forwarding incoming packets and gaining reputation in the network. Nodes willing to do so must compete against each other. The competition is based on auction theory. We also formulate attack-defense problem as a non-cooperative nonzero-sum two-player game between an attacker and a wireless sensor network. This game achieves Nash equilibrium and thus leading to a defense strategy for the network. This approach is called utility based dynamic source routing (UDSR), which incorporates the total utility of each route in data packets. Results show that the proposed game frameworks significantly increase the chance of success in defense strategy for the wireless sensor network","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128255009","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}
{"title":"Void traversal for guaranteed delivery in geometric routing","authors":"Mikhail Nesterenko, Adnan Vora","doi":"10.1109/MAHSS.2005.1542862","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542862","url":null,"abstract":"Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorithms run on planar graphs only. To efficiently construct a planar graph, they require a unit-disk graph. To make the topology unit-disk, the maximum link length in the network has to be selected conservatively. In practical setting this leads to the designs where the node density is rather high. Moreover, the network diameter of a planar subgraph is greater than the original graph, which leads to longer routes. To remedy this problem, we propose a void traversal algorithm that works on arbitrary geometric graphs. We describe how to use this algorithm for geometric routing with guaranteed delivery and compare its performance with GFG","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128393953","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}
{"title":"Pre-scanning and dynamic caching for fast handoff at MAC layer in IEEE 802.11 wireless LANs","authors":"Noor Mustafa, W. Mahmood, A. Chaudhry, M. Ibrahim","doi":"10.1109/MAHSS.2005.1542783","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542783","url":null,"abstract":"In recent years, wireless LANs have been widely deployed in public places because of its low cost and high-speed connectivity. To cover larger areas, many APs are required which necessitate the use of handoff between different APs. Therefore handoff latency has become essential issue in wireless LANs. The delay caused by handoff process affects the quality of real-time applications like VoIP. So, in order to resolve this problem, an improved fast handoff mechanism is required that can minimize the overall handoff latency enough to run voice and video applications seamlessly. Handoff consists of three phases including scanning, reauthentication, and reassociation. Scanning is the most time consuming phase among all three. We propose a fast handoff scheme in which channels are scanned prior to the time of handoff. This novel approach almost eliminates scanning delay by using a pre-scanning algorithm and it takes only few milli seconds by using a dynamic caching mechanism","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124566728","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}
{"title":"Reactive ID assignment for sensor networks","authors":"Hongbo Zhou, M. Mutka, L. Ni","doi":"10.1109/MAHSS.2005.1542845","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542845","url":null,"abstract":"Globally unique ID allocation is usually not applicable in a sensor network due to the massive production of cheap sensor nodes, the limited bandwidth, and the size of the payload. However, locally unique IDs are still necessary for nodes to implement unicast communications to save power consumption. Several solutions have been proposed for locally unique ID assignment in sensor networks. However, they bring much communication overhead, which is not desirable due to the limited power supply in a sensor node. Combined with a directed diffusion communication paradigm, a reactive ID assignment scheme with security mechanisms is proposed in this paper. It defers ID conflict resolution until data communications are initiated and thus saves communication overhead","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126820068","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}
{"title":"Peer identification in wireless and sensor networks using signal properties","authors":"Tina Suen, Alec Yasinsac","doi":"10.1109/MAHSS.2005.1542878","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542878","url":null,"abstract":"In this paper, we investigate methods to determine a transmitting peer node's location using signal properties and trusted-peer collaboration. We then consider how this location information can establish peer identity confidence. Specifically, we consider using signal direction, signal strength, and collaboration to establish the transmitter's location with sufficient precision to enable identification through location. Network density, node characteristics such as size and speed, and communication capabilities are all considered in our analysis","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128781378","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}
{"title":"Multi-modal MAC design for energy-efficient wireless networks","authors":"S. Goel, T. Elbatt, M. Srivastava","doi":"10.1109/MAHSS.2005.1542788","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542788","url":null,"abstract":"In this paper we explore the design of multi-modal MAC for wireless ad hoc and sensor networks that dynamically adapt its behavior in order to minimize the energy to delivery ratio under a wide variety of network loads. The prime motivation is to balance the inherent trade-off between the energy wasted in collisions and the energy expended by collision avoidance handshake mechanisms. Towards this objective, the study goes through two phases. First, we explore the space of MAC modes subject to the constraint that different access schemes can inter-operate. Accordingly, we limit our attention to modes within the non-slotted random access paradigm. Second, we analyze, with the aid of detailed network simulations, the energy performance trade-offs of four variations of the CSMA/CA access scheme. Initial results reveal interesting observations related to the energy/delivery contribution of channel reservation and single-hop acknowledgment packets under a wide variety of temporal network loads","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127309714","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}