{"title":"RT-Link: A Time-Synchronized Link Protocol for Energy- Constrained Multi-hop Wireless Networks","authors":"Anthony G. Rowe, R. Mangharam, R. Rajkumar","doi":"10.1109/SAHCN.2006.288496","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288496","url":null,"abstract":"We propose RT-link, a time-synchronized link protocol for real-time wireless communication in industrial control, surveillance and inventory tracking. RT-link provides predictable lifetime for battery-operated embedded nodes, bounded end-to-end delay across multiple hops, and collision-free operation. We investigate the use of hardware-based time-synchronization for infrastructure nodes by using an AM carrier-current radio for indoors and atomic clock receivers for outdoors. Mobile nodes are synchronized via in-band software synchronization within the same framework. We identify three key observations in the design and deployment of RT-link: (a) hardware-based global-time synchronization is a robust and scalable option to in-band software-based techniques, (b) achieving global time-synchronization is both economical and convenient for indoor and outdoor deployments, (c) RT-link achieves a practical lifetime of over 2 years. Through analysis and simulation, we show that RT-link outperforms energy-efficient link protocols such as B-MAC in terms of node lifetime and end-to-end latency. The protocol supports flexible services such as on-demand end-to-end rate control and logical topology control. We implemented RT-link on the CMU FireFly sensor platform and have integrated it within the nano-RK real-time sensor OS. A 42-node network with sub-20 mus synchronization accuracy has been deployed for 3 weeks in the NIOSH Mining Research Laboratory and within two 5-story campus buildings","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"57 1","pages":"402-411"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75526964","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":"Emulation Architecture Implementation and Design","authors":"A. Giovanardi, G. Mazzini","doi":"10.1109/SAHCN.2006.288537","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288537","url":null,"abstract":"The design and implementation of an emulation architecture for ad hoc networks is described in details and tested. The tool is able to emulate many unicast routing protocols with a real exchange of signaling and data packets between the hosts present in the network. With respect to a wireless test bed, the emulator works on hosts connected each other via wired links and the wireless channel is simulated. The emulator works in the user space, and allows an easy interface with the Simple ad hoc simulator (SAM), where many routing protocols are present","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"1 1","pages":"723-728"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75545288","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":"Distributed Fair Transmit Power Adjustment for Vehicular Ad Hoc Networks","authors":"M. Torrent-Moreno, P. Santi, H. Hartenstein","doi":"10.1109/SAHCN.2006.288504","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288504","url":null,"abstract":"Improving the safety of drivers and passengers by wirelessly exchanging information between vehicles represents a major driving force for the design of vehicular ad hoc networks. In a heavy loaded 802.11-based network, however, safety-related packets might collide frequently and cannot be decoded by a receiver, thus they might not be effective in increasing the safety level on the roads. In this paper, we propose to use transmit power control in order to reduce packet collisions, while taking into account the major design goal of vehicular ad hoc networks, i.e. increasing safety. While previous work has addressed the issue of power control primarily for optimizing network capacity and/or connectivity, the optimization criterion for improving safety has to be built upon the concept of fairness: a higher transmit power of a sender should not be selected at the expense of preventing other vehicles to send/receive their required amount of safety information. In this paper, we propose a fully distributed and localized algorithm called D-FPAV (distributed fair power adjustment for vehicular networks) for adaptive transmit power adjustment which is formally proven to achieve max-min fairness. Furthermore, we investigate the effectiveness and robustness of D-FPAV through extensive simulations based on a realistic highway scenario and different radio propagation models","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"24 1","pages":"479-488"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88206916","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":"Scalable Routing in Sensor Actuator Networks with Churn","authors":"T. Fuhrmann","doi":"10.1109/SAHCN.2006.288406","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288406","url":null,"abstract":"Routing in wireless networks is inherently difficult since their network topologies are typically unstructured and unstable. Therefore, many routing protocols for ad-hoc networks and sensor networks revert to flooding to acquire routes to previously unknown destinations. However, such an approach does not scale to large networks, especially when nodes need to communicate with many different destinations. This paper advocates a novel approach, the scalable source routing (SSR) protocol. It combines overlay-like routing in a virtual network structure with source routing in the physical network structure. As a consequence, SSR can efficiently provide the routing semantics of a structured routing overlay, making it an efficient basis for the scalable implementation of fully decentralized applications. In T. Fuhrmann (2005) it has been demonstrated that SSR can almost entirely avoid flooding, thus leading to a both memory and message efficient routing mechanism for large unstructured networks. This paper extends SSR to unstable networks, i. e. networks with churn where nodes frequently join and leave, the latter potentially ungracefully","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"10 1","pages":"30-39"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79576951","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":"Novel Sensor MAC Protocol Applied to Cayley and Manhattan Street Networks with CrossBow MICA2","authors":"E. Noel, K. Tang","doi":"10.1109/SAHCN.2006.288522","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288522","url":null,"abstract":"With the rapid growth of wireless sensor technology, we foresee a need for MAC protocols to allow efficient simultaneous peer-to-peer communications in large and dense wireless sensor networks. To meet such a need, we propose a novel MAC protocol that exploits network graphs property to assign frequencies such that the number of intermediate hops to reach destinations is minimized. Via a simulation model parameterized to CrossBow MICA2, we evaluate the performance of our MAC protocol with Cayley and Manhattan Street networks","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"53 1","pages":"626-631"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73392063","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 Probabilistic Energy-Efficient Routing (PEER) Scheme for Ad-hoc Sensor Networks","authors":"Kai Chen, Yang Qin, Fan Jiang, Zongyao Tang","doi":"10.1109/SAHCN.2006.288590","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288590","url":null,"abstract":"Wireless ad-hoc sensor networks consist of small nodes with sensing, computing, and communicating capabilities. Energy deficiency is a key problem of these kinds of networks. Many routing, power management, and data dissemination protocols have been specifically designed for them where energy awareness is a chief design issue. This paper proposes a new probabilistic agent-based energy efficient routing strategy (PEER). In contrast to the earlier work that focus on energy-aware routing, PEER takes into account both total cost and individual residual energy of the whole path statistically (path-based) when selecting the next hop, i.e. each intermediate node chooses its next hop node based on the statistical path information from that node to the sink. We show through analysis and simulations that PEER can prolong the network survivability, shorten the average packet delay, and hence outperform all the existing routing schemes. Moreover, we conjecture that the coefficient rho in PEER may be intelligently adjusted to fit the situation of the volatile networks, thus we make further investigation into it and achieve the intending results","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"4 1","pages":"964-970"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81251399","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":"Throughput-Oriented MAC for Mobile Networks with Variable Packet Sizes","authors":"Fan Wang, O. Younis, M. Krunz","doi":"10.1109/SAHCN.2006.288498","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288498","url":null,"abstract":"Improving the network throughput is a primary objective in mobile ad hoc networks (MANETs), which is motivated by the over-conservative nature of the 802.11 standard. Transmission power control (TPC) was proposed for improving spatial reuse and reducing energy consumption in MANETs. Previous TPC protocols either incur extra hardware cost (e.g., require multiple transceivers) or do not fully exploit the potential of power control. In this work, we propose distributed, single-channel MAC protocols for MANETs that exploit TPC and account for different packet sizes in the system to further maximize spatial reuse. We model channel contention in the network as a non-cooperative game. Multiple potential transmitters are first involved in an admission phase which enables terminals to compute the transmission powers that achieve a Nash equilibrium (NE) for a given utility function. Subsequently, successful contenders in the same neighborhood can simultaneously proceed with their transmissions. Simulation results show that our protocols significantly improve the network throughput (in terms of transmitted bits/second or the number of admitted contenders) over previously proposed schemes. Our results also indicate that these gains do not require additional energy cost","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"11 1","pages":"421-430"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76161726","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":"Application of Video Sensor Networks in Traffic Surveillance","authors":"Fuqiang Liu, K. Zhou, Donglei Wang","doi":"10.1109/SAHCN.2006.288582","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288582","url":null,"abstract":"This paper proposes a new data link routing protocol, which realizes more efficient transmitting of video information and meets the requirement of traffic organization and data collection. It takes the traffic circumstance into consideration and synthesizes the two classic protocols, LEACH and PEGASIS. In order to realize the visual management of the traffic network, we allocate sensors along the roads, so as to introduce a link configuration. We also consider the usage of cluster for time saving. This paper focuses on the comparison of the three protocols, LEACH, PEGASIS and the newly proposed algorithm. The simulation results indicate that our algorithm is much better than LEACH in power consumption and smarter than PEGASIS in network latency. Furthermore, the data collected by applying this protocol are the most suitable for the further work in ITS data analysis","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"334 1","pages":"916-919"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77630934","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":"Deployment Strategies for Differentiated Detection in Wireless Sensor Networks","authors":"Jingbin Zhang, Ting Yan, S. Son","doi":"10.1109/SAHCN.2006.288436","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288436","url":null,"abstract":"In this paper, we address the deployment problem for differentiated detection requirements, in which the required detection probability thresholds at different locations are different. We focus on differentiated deployment algorithms that are applied to the probabilistic detection model, since it is more realistic than the binary detection model. We show that the relationship between the node deployment strategy and the logarithmic collective miss probability distribution is linear shift invariant (LSI). Using this property, we formulate the differentiated deployment problem as an integer linear programming problem, which is a well known NP-hard problem. We propose a differentiated node deployment algorithm called DIFF_DEPLOY, which achieves much better performance than the state-of-the-art node deployment algorithm for both uniform and differentiated detection requirements","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"98 2","pages":"316-325"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/SAHCN.2006.288436","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72456274","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 Communication-Theoretic Approach to Ad Hoc Wireless Networking","authors":"O. Tonguz, G. Ferrari","doi":"10.1109/SAHCN.2006.288536","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288536","url":null,"abstract":"The remarkable surge in research on ad hoc wireless networks is largely due to their potential in offering insfrastructureless communications. While initially studied adopting a \"conventional\" networking approach, based upon years of research experience on wired computer networks (with virtually error-free communication links), the presence of unreliable wireless communication links necessitates a communication-theoretic foundation for the design and analysis of wireless ad hoc networks. Such a novel comprehensive \"bottom-up\" perspective was, for the first time, presented in OK Tonguz et al. (2006). In this paper, we summarize the communication-theoretic framework, where the impact of physical layer on the network performance and its interaction with higher layers is taken into account. The main goal of this paper is to provide the reader with the intuition behind the comprehensive approach, rather than the mathematical details of the approach","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"37 1","pages":"715-722"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72667115","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}