{"title":"Progressive Network Coding for Message-Forwarding in Ad-Hoc Wireless Networks","authors":"Xingkai Bao, Jing Li","doi":"10.1109/SAHCN.2006.288425","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288425","url":null,"abstract":"We consider multi-hop transmission from the source to the destination in ad-hoc wireless networks. Cooperative forwarding approaches in the framework of progressive network coding are proposed which generalize coded cooperation in a multi-hop context. In this framework, the source node and each succeeding relay node progressively decode what they receive from the previous stages and re-encode the messages to different parts of the parity bits from a single (network) codeword hop by hop. The maximal achievable rates for the multi-hop wireless networks using traditional repetition-forward and progressive network coding are analyzed with respect to different transmit power constraint and packet length allocation. The optimal number of relays are derived in each scheme. It is found that progressive network coding with adaptive packet length significantly increases the system throughput and improves the energy efficiency","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"462 1","pages":"207-215"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88386854","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":"MERIT: MEsh of RF sensors for Indoor Tracking","authors":"Yui-Wah Lee, E. P. Stuntebeck, Scott C. Miller","doi":"10.1109/SAHCN.2006.288511","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288511","url":null,"abstract":"A traditional approach to indoor tracking utilizes non-RF ranging techniques, such as infrared or ultrasound. The problem with these non-RF ranging techniques is that they do not work well when the tracking devices are buried in users' wallets or bags. As a result, there has been considerable interest in using only RF techniques for indoor tracking. Existing RF-only techniques, however, typically require a costly site survey and a floor-plan. In this paper, we present the MERIT system that we designed, implemented, and evaluated. MERIT is significantly different from existing systems in that it is pure RF-based yet it does not require a site survey nor a floor-plan. MERIT tracks users to a room granularity, and it can disambiguate neighboring rooms. This disambiguation is challenging because RF signals can traverse through walls. Also, because of indoor multipath interference, it is difficult to correlate signal strength with distance. In this work, we proposed two techniques for accurate disambiguation: spatial diversity and RF reflector. In our evaluation MERIT achieved an accuracy of 98.9%. MERIT was first conceived for a telecommunication application - intelligent telephone call routing, but it can also be used for other location-aware services","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"14 1","pages":"545-554"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82203893","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":"Circular-Layer Algorithm for Ad Hoc Sensor Networks to Balance Power Consumption","authors":"D. Wei, A. Chan, Kevin V. N. Kameri","doi":"10.1109/SAHCN.2006.288587","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288587","url":null,"abstract":"In senor networks, the data traffic from the sensors are directional towards a data sink and are therefore uneven. The areas nearer the data sink experience higher data traffic and will run out of energy sooner. Circular-layer geometry takes into account the radial data traffic towards the data sink. We may construct an algorithm to divide the network into equal-area circular-layers, which are analogous to the square design in geographical adaptive fidelity (GAF). However, the circular-layer geometry alone has not taken into account the uneven data traffic. This paper proposes a circular-layer algorithm that schedules the sensors into active and sleep states in such a way as to evenly distribute the power consumption throughout the sensor networks. We divide the network into circular layers with the data sink at the center. The algorithm equalizes the lifetime time of all layers so that the nodes near the data sink will not run out of energy sooner. Energy is also wasted in reactive routing where the sensors flood the network with omni-directional route discovery messages to find a suitable route towards the data sink. This algorithm reduces such flooding by directing the route request messages towards the data sink, resulting in more energy saving. The circular-layer geometry alone is serving to save energy. In addition, balancing the power consumption throughout the network yields an additional lifetime extension of 21% in our simulation results of a four-layer scenario","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"65 1","pages":"945-950"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77801300","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 Trust Based Framework for Secure Data Aggregation in Wireless Sensor Networks","authors":"W. Zhang, Sajal K. Das, Yonghe Liu","doi":"10.1109/SAHCN.2006.288409","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288409","url":null,"abstract":"In unattended and hostile environments, node compromise can become a disastrous threat to wireless sensor networks and introduce uncertainty in the aggregation results. A compromised node often tends to completely reveal its secrets to the adversary which in turn renders purely cryptography-based approaches vulnerable. How to secure the information aggregation process against compromised-node attacks and quantify the uncertainty existing in the aggregation results has become an important research issue. In this paper, we address this problem by proposing a trust based framework, which is rooted in sound statistics and some other distinct and yet closely coupled techniques. The trustworthiness (reputation) of each individual sensor node is evaluated by using an information theoretic concept, Kullback-Leibler (KL) distance, to identify the compromised nodes through an unsupervised learning algorithm. Upon aggregating, an opinion, a metric of the degree of belief, is generated to represent the uncertainty in the aggregation result. As the result is being disseminated and assembled through the routes to the sink, this opinion will be propagated and regulated by Josang's belief model. Following this model, the uncertainty within the data and aggregation results can be effectively quantified throughout the network. Simulation results demonstrate that our trust based framework provides a powerful mechanism for detecting compromised nodes and reasoning about the uncertainty in the network. It further can purge false data to accomplish robust aggregation in the presence of multiple compromised nodes","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"19 1","pages":"60-69"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73366011","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":"Relationship -based Detection of Spoofing -related Anomalous Traffic in Ad Hoc Networks","authors":"Qing Li, W. Trappe","doi":"10.1109/SAHCN.2006.288408","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288408","url":null,"abstract":"Spoofing is a serious threat for both ad hoc and sensor networks, that can cause adverse effects on a network's operations. Although cryptographic authentication can assure the identity of a transmitter, authentication is not always desirable or possible as it requires key management and more extensive computations. In this paper we argue that it is desirable to have a functionality complementary to traditional authentication that can detect device spoofing with no dependency on cryptographic material. Towards this objective, we propose using forge-resistant relationships associated with transmitted packets to detect anomalous activity. Our strategy is generic, operates in a 1-hop neighborhood, and thus can locally provide protection in order to defend ad hoc or sensor networks from anomalous intrusions. As two specific constructions, we explore the use of monotonic relationships in the sequence number fields, and the enforcement of statistical characteristics of legitimate traffic. We then provide an example of how these relationships can be used to construct a classifier that provides a multi-level threat assessment. We validate the usefulness of these methods for anomalous traffic scenarios involving multiple sources sharing the same MAC address through experiments conducted on the ORBIT wireless testbed","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"40 1","pages":"50-59"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79299168","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":"Power Efficient and Low Latency MAC for Wireless Sensor Networks","authors":"Sumeet N. Parmar, Sukumar Nandi, A. Chowdhury","doi":"10.1109/SAHCN.2006.288586","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288586","url":null,"abstract":"Existing protocols for medium access in wireless sensor networks opt for staggered wakeup scheduling among clusters of nodes. However intra-cluster contention and interference has remained an unaddressed issue. In this work we propose PELLMAC: power efficient and low latency MAC for wireless sensor networks, a schema that addresses node scheduling for channel access. By limiting contention between adjacent branches of the data gathering tree, we are able to reduce the latency of the network, as well as optimize energy utilization. Simulation results, in accordance with our claims, show that PELLMAC enhances performance in energy savings, latency and delivery ratio","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"25 1","pages":"940-944"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80152539","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":"Analysis of Co-existence between IEEE 802.11 and IEEE 802.16 Systems","authors":"N. J. Thomas, M. Willis, K. Craig","doi":"10.1109/SAHCN.2006.288520","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288520","url":null,"abstract":"Both IEEE 802.11 and IEEE 802.16 standards have become widespread throughout the world in license-exempt spectrum specifically in the 5 GHz band. However there is a problem in that the two standards are not designed to co-exist in close proximity together on the same or overlapping channels. In this paper an initial analysis of the performance degradation for co-existing IEEE 802.11 and IEEE 802.16 systems is presented. Analysis is carried out at the medium access control (MAC) layer by means of an event model based simulation tool. The results show that in co-existence scenarios the performance of both systems will degrade severely and as a result spectrum efficiency can drop to close to zero","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"51 1","pages":"615-620"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85923387","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 NEW SOLUTION BASED ON MONTE CARLO TO WIRELESS SENSOR NETWORK DENSITY CONTROL PROBLEM","authors":"Jia Yufii, D. Tianlin","doi":"10.1109/SAHCN.2006.288577","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288577","url":null,"abstract":"An effective approach for energy conservation in wireless sensor networks is to schedule sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. In this paper, we proposed a new scheme based on Monte Carlo algorithm to test whether the nodes deployed in interested region are redundant or not. The computational complexity is only O (n). It also established the coverage collision detection and back-off mechanism applied in the wireless sensor network. The simulation results show that the system can cover all the interested area with least nodes and the coverage void will not appear during the course of state-transition. The coverage collision detection and back-off mechanism proposed in this article can be applied when the nodes both have synchronous and asynchronous mechanism. It also provides a stable stage with the length of the time can be adjusted","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"14 1","pages":"886-891"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90730333","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":"Performance of Cooperative and Single Relay Sensor Networks Under Same Energy Constraints","authors":"Lichuan Liu, Zhigang Wang","doi":"10.1109/SAHCN.2006.288559","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288559","url":null,"abstract":"This work studies the impact of the network resource constraints on the performance of wireless multi-hop relay sensor networks. The cooperative relay method based on the differential space-time block code (DSTBC) in sensor network is introduced. The energy consumption is also investigated for different kinds of relay method. Based on the same total energy consumption requirement, we analyze the system performance using M/G/1 queueing system. The performance evaluation show that the cooperative relay scheme can significantly increase the system performance in terms of throughput and end-to-end delay in high SNR environment","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"21 1","pages":"767-772"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88968876","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":"SECON 2006 - Additional Reviewers","authors":"","doi":"10.1109/sahcn.2006.288397","DOIUrl":"https://doi.org/10.1109/sahcn.2006.288397","url":null,"abstract":"The conference offers a note of thanks and lists its reviewers.","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"22 1","pages":"x-x"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83355326","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}