{"title":"A flooding protocol for MANETs with self-pruning and prioritized retransmissions","authors":"M. Jacobsson, Cheng Guo, I. Niemegeers","doi":"10.1109/MAHSS.2005.1542772","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542772","url":null,"abstract":"In this paper, we introduce a highly efficient flooding protocol for MANETs using only one-hop hello messages. By simulation, we show that the protocol has a performance close to flooding protocols that use two-hop hello messages. Further, the protocol performs very good even when the node mobility increases. The only \"cost\" this protocol must pay is an increased end-to-end delay. However, with some clever cross-layer optimization, this delay can be reduced to become comparable with other flooding protocols. Further, the overhead generated for flooding a packet by this protocol is lower than other protocols, if one-hop hello messages are already provided","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"162 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":"115314491","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":"Conserving energy with on-demand topology management","authors":"C. Sengul, R. Kravets","doi":"10.1109/MAHSS.2005.1542831","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542831","url":null,"abstract":"To reduce idle-time energy consumption, nodes in ad hoc networks can switch to a power-save mode. However, since operating all nodes in power-save mode limits network capacity, some nodes may need to stay in active mode to support forwarding. The main challenge of selecting nodes to stay in active mode stems from the need to conserve energy while maintaining communication. Although topology management protocols build a forwarding backbone of active nodes by powering down redundant nodes, such protocols incur proactive backbone maintenance overhead. The reactive approach, on-demand power management, manages node transitions from active to power-save mode based on routing information. However, node transitions are only traffic-driven and may result in keeping redundant nodes awake. To this end, we propose TITAN, which builds a backbone reactively using information about both ongoing communication and the current power-management mode of nodes. The design of TITAN is based on the trade-offs between waking up power-saving nodes on shorter routes and using longer routes that contain active nodes. Simulation results show that TITAN conserves energy while maintaining efficient communication without additional control overhead for topology management","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":"129888770","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":"Cross-layer flooding for sensor networks without location information","authors":"Y. Ghiassi-Farrokhfal, Mohammadreza Pakravan","doi":"10.1109/MAHSS.2005.1542782","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542782","url":null,"abstract":"Flooding algorithm is one of the most significant algorithms used in sensor networks. Although simple, this algorithm causes a large amount of energy and bandwidth to be wasted. The most important application of flooding is RREQ flooding in initial step of most routing algorithms. Although simple, this algorithm causes a large amount of energy and bandwidth to be wasted. Most previous efficient flooding algorithms use location information, which is impossible for simple node in sensor network. Some others are not suitable for RREQ flooding due to eliminating redundant retransmissions. We present a modified flooding that simultaneously decreases energy consumption as well as network delay. This flooding algorithm is a form of cross layer algorithm which uses physical layer information to be more efficient in time and energy. It is shown that the proposed algorithm can save a significant amount of energy while reducing the settling time delay","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":"125378628","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":"A scalable and adaptive clock synchronization protocol for IEEE 802.11-based multihop ad hoc networks","authors":"Dong Zhou, T. Lai","doi":"10.1109/MAHSS.2005.1542843","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542843","url":null,"abstract":"This paper studies the fundamental problem of clock synchronization in IEEE 802.11-based multihop ad hoc networks. Clock synchronization is important for power saving, network throughput and many basic operations of 802.11 protocols in a multihop ad hoc network (MANET). The scalability problem of 802.11 timing synchronization has been studied extensively in single hop ad hoc networks and good solutions are available. However these solutions do not perform well in the MANET environment. A few multihop solutions were proposed; but the performance is still not very good. The maximum clock offset is still over 200 mus for these protocols. In this paper, we propose an adaptive protocol through beacon transmission prioritization, frequency adjustment and construction of dominating set. The frequency adjustment is proved to be bounded. Simulation shows that we are able to control the maximum clock offset under 50 mus after protocol stabilization. The improvement is more than 400% over the current solutions with similar complexity. The new protocol also shows great long-term stability","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"33 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":"130228716","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":"On the lifetime analysis of always-on wireless sensor network applications","authors":"Santosh Kumar, A. Arora, T. Lai","doi":"10.1109/MAHSS.2005.1542797","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542797","url":null,"abstract":"Majority of papers in the area of wireless sensor networks (WSNs) have an element of energy-efficiency and associated with it an analysis of network lifetime. Yet, there is no agreement on how to analyze the lifetime of a WSN. As a result, errors are frequently made on both sides. Some underestimate the network lifetime by an order of magnitude, while others end up overestimating the lifetime by a significant factor. This paper presents a first step towards standardizing the lifetime analysis of WSNs. We focus on WSNs deployed for always-on applications, where the problem of power management is most severe because the environment needs to be monitored continuously. Underestimation of network lifetime is common when proposing sleep-wakeup schemes, where it is frequently assumed that in the absence of a sleep-wakeup scheme, a sensor node from the Mica family lasts 3-5 days on a pair of AA batteries. We show that the same sensor node can be made to last more than 36 days, even if it is continuously monitoring the environment. Overestimation typically occurs when proposing non-sleep-wake up power management schemes such as in-network data aggregation. Overestimation occurs because several network activities (e.g periodic routing messages) are assumed to have negligible effect on the network lifetime and therefore are ignored in the lifetime analysis. We use our recent experience in deploying ExScal (a large-scale WSN for intrusion detection) to identify major components in the network lifetime analysis. We then present a careful lifetime analysis of ExScal and show how to analyze the effects of using various non-sleep-wake up power management schemes such as hierarchical sensing, low-power listening, and in-network data aggregation on the network lifetime. Our lifetime analysis will be useful as a template in analyzing the lifetime of other WSNs deployed for always-on applications","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":"121792076","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":"Location-centric storage for sensor networks","authors":"Kai Xing, Xiuzhen Cheng, Jiang Li","doi":"10.1109/MAHSS.2005.1542836","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542836","url":null,"abstract":"This paper presents location-centric storage (LCS), a novel distributed data storage protocol for sensor networks. In the protocol, each event detected by sensors is associated with an intensity value (delta)(by sensors), where delta is a parameter that depends on the characteristics of the event and the application context. When event information is broadcast, a sensor decides whether to store the record of an event by checking its distance to the event location and the delta. In general, the higher the intensity of an event, the further its information can propagate geographically in the sensor network. Besides, the closer to the event location, the denser the sensors are that store the event information, and thus the quicker and better a user can know about the event (by reading from surrounding sensors). The protocol utilizes network resource efficiently. In particular, the storage load of sensors is independent of the network size, and is evenly distributed across the network. Moreover, the communication distance for getting event information is small. Therefore, the protocol has great scalability. We provide detailed theoretical analysis and simulation study to support the claims. We also ran simulations to show the advantage of our protocol over some previous work. LCS can be used for applications such as context-dependent information mining in pervasive computing and on-demand warning in surveillance sensor networks","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"746 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":"115837206","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":"Secure localization in sensor networks using transmission range variation","authors":"F. Anjum, S. Pandey, P. Agrawal","doi":"10.1109/MAHSS.2005.1542800","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542800","url":null,"abstract":"In a wireless sensor network, sensors can be randomly distributed in order to collect data from a site. In many cases the location of the wireless sensor nodes is required in order to map the collected data to a particular location. Various schemes have been proposed earlier to estimate the location of sensor nodes in a sensor network. However most of these schemes assume the absence of a malicious user in the system which might not always be true. This paper presents a secure localization algorithm (SLA) that can be implemented with the capabilities of current sensor nodes without the need for any additional specialized hardware. The scheme is based on the transmission of nonces at different power levels from the anchor nodes. A sensor node receives a certain set of nonces which it will have to transmit back to the sink via the anchor nodes. The location of the sensor node can be estimated securely based on this set of nonces. We have investigated the properties of SLA using simulations","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"3 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":"126519305","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":"A stochastic model for optimizing physical carrier sensing and spatial reuse in wireless ad hoc networks","authors":"Hui Ma, Hamed M. K. Alazemi, Sumit Roy","doi":"10.1109/MAHSS.2005.1542851","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542851","url":null,"abstract":"The choice of physical carrier sensing (PCS) threshold is key to the trade-off between the amount of spatial reuse and probability of packet collisions in a wireless ad hoc network. In this paper, we present a new analytical approach for optimizing the PCS threshold as measured by probability of packet collisions and the aggregate one-hop throughput. Our model simultaneously incorporates the impact of PCS threshold and the backoff mechanism via a suitable Markov chain model for saturation (i.e. all nodes always have a packet to send in their queues). Elaborate OPNET simulation results show the effectiveness of the analytical model","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"33 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":"125691357","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":"Energy-constrained task mapping and scheduling in wireless sensor networks","authors":"Yuan Tian, E. Ekici, F. Özgüner","doi":"10.1109/MAHSS.2005.1542802","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542802","url":null,"abstract":"Collaboration among sensors through parallel processing mechanisms emerges as a promising solution to achieve high processing power in resource-restricted wireless sensor networks (WSN). Although task mapping and scheduling in wired networks of processors has been well studied in the past, their application to WSNs remains largely unexplored. Due to the limitations of WSNs, existing algorithms cannot be directly implemented in WSNs. In this paper, a task mapping and scheduling solution for energy-constrained applications in WSNs, energy-constrained task mapping and scheduling (EcoMapS), is presented. EcoMapS incorporates channel modeling, concurrent task mapping, communication and computation scheduling, and sensor failure handling algorithm. The performance of EcoMapS is evaluated through simulations with randomly generated directed acyclic graphs (DAG). Simulation results show significant performance improvements compared with an existing mechanism in terms of minimizing schedule lengths subject to energy consumption constrains","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"35 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":"131585521","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":"A predictive QoS control strategy for wireless sensor networks","authors":"Biyu Liang, J. Frolik, Xiaoyan Wang","doi":"10.1109/MAHSS.2005.1542810","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542810","url":null,"abstract":"The number of active sensors in a wireless sensor network has been proposed as a measure, albeit limited, for quality of service (QoS) for it dictates the spatial resolution of the sensed parameters. In very large sensor network applications, the number of sensor nodes deployed may exceed the number required to provide the desired resolution. Herein we propose a method, dubbed predictive QoS control (PQC), to manage the number of active sensors in such an over-deployed network. The strategy is shown to obtain near lifetime and variance performance in comparison to a Bernoulli benchmark, with the added benefit of not requiring the network to know the total number of sensors available. This benefit is especially relevant in networks where sensors are prone to failure due to not only energy exhaustion but also environmental factors and/or those networks where nodes are replenished over time. The method also has advantages in that only transmitting sensors need to listen for QoS control information and thus enabling inactive sensors to operate at extremely low power levels","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"20 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":"131874921","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}