{"title":"Cross-layered Hop-by-Hop Congestion Control for Multihop Wireless Networks","authors":"Kang-Yong Lee, Keeseong Cho, Byung-Sun Lee","doi":"10.1109/MOBHOC.2006.278590","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278590","url":null,"abstract":"In this paper, we present a novel congestion control algorithm (HRC), which uses hop-by-hop approach and rate-based transmission, for IEEE 802.11 multihop wireless networks. Since medium contention is most dominant cause of packet loss in multihop wireless networks, our algorithm considers the degree of medium contention level experienced at a given node for data rate control at the transport layer. The main purpose of our algorithm is to maximize the network throughput by data rate control while minimizing the packet losses caused by medium contention. The simulation study using GloMoSim shows that our algorithm achieves up to 40% more the network throughput than TCP and TCP-selective acknowledgment (SACK)","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"94 1-2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116695398","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":"Deterministic key pre-distribution schemes for mobile ad-hoc networks based on set systems with limited intersection sizes","authors":"E. Makri, Y. Stamatiou","doi":"10.1109/MOBHOC.2006.278661","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278661","url":null,"abstract":"One of the major issues involved in mobile ad-hoc network security is that of key management. Key management refers to the creation, distribution and revocation of keys amongst the network. A solution to these issues is given by key pre-distribution schemes according to which each node is initially given a set of keys from which keys can be chosen to be used for their communication needs. In this paper we first give a formal definition of what constitutes a desirable set system design for key pre-distribution and propose a deterministic key pre-distribution scheme based on set systems whose members have intersection sizes that fall within a limited, predetermined range. The resulting key sets are theoretically shown to possess many of the properties of desirable set system design","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114495202","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 Ad hoc Multiple channel Multicasting Protocol","authors":"Ravindra Vaishampayan, J. Garcia-Luna-Aceves","doi":"10.1109/MOBHOC.2006.278550","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278550","url":null,"abstract":"Capacity improvement is one of the major challenges in the design of mobile ad hoc networks. Use of multiple channels is a useful technique in order to achieve capacity improvement by allowing nodes that need to exchange data to operate on the same channel and nodes that do not need to exchange data to operate on different channels. In the recent past some research has been done in the area of improving channel capacity using multiple channels for unicast flows. However we are not aware of any prior work for improving the channel capacity for multicast flows. We present the cross layer ad hoc multiple channel multicasting protocol (CLAMMP) for mobile ad hoc networks (MANET's). CLAMMP is the first protocol for MANET's which uses multiple channels to increase capacity for multicasting flows. CLAMMP is a cross-layered protocol in the sense that it traverses both the routing as well as the MAC layers. Using simulations in Qualnet 3.5, we compare CLAMMP with PUMA (tree-mode) and ODMRP, which are representatives of mesh-based and tree-based multicast routing in ad hoc networks. The results from a wide range of scenarios show that CLAMMP improves network capacity by an order of magnitude compared to the other two protocols","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128389265","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":"Gateway Subset Difference Revocation","authors":"Jeff Opper, B. DeCleene, M. Leung","doi":"10.1109/MOBHOC.2006.278662","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278662","url":null,"abstract":"Subset difference revocation (SDR) provides a powerful mechanism for the efficient expression of the revocation state of a large group of key recipients. However, arbitrary assignment of receivers as leaf nodes in a static binary tree can lead to inefficiencies in certain group revocation states. Gateway subset difference revocation (GSDR), developed in our ongoing SecureKeys effort, provides the ability to group receivers based upon organizational characteristics while simultaneously introducing the ability to audit rekey and data transmission, delegate rekey decisions to subordinate decision makers, and override subordinate rekey authority when necessary. GSDR extends the existing SDR scheme by deploying rekey gateways in a hierarchy that mimics an organic decision making structure. Delegation of rekey authority offloads a significant computational and communications burden from gateways high in the tree, while correspondingly partitioning the rekey traffic required to be processed by leaf nodes in the tree. GSDR also significantly reduces label storage requirements in rekey devices by limiting terminal node fan-out","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129803143","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}
E. Ngai, Yangfan Zhou, Michael R. Lyu, Jiangchuan Liu
{"title":"Reliable Reporting of Delay-Sensitive Events in Wireless Sensor-Actuator Networks","authors":"E. Ngai, Yangfan Zhou, Michael R. Lyu, Jiangchuan Liu","doi":"10.1109/MOBHOC.2006.278546","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278546","url":null,"abstract":"Wireless sensor-actuator networks, or WSANs, greatly enhance the existing wireless sensor network architecture by introducing powerful and even mobile actuators. The actuators work with the sensor nodes, but can perform much richer application-specific actions. To act responsively and accurately, an efficient and reliable reporting scheme is crucial for the sensors to inform the actuators about the environmental events. Unfortunately, the low-power multi-hop communications in a WSAN are inherently unreliable; the frequent sensor failures and the excessive delays due to congestion or in-network data aggregation further aggravate the problem. In this paper, we propose a general reliability-centric framework for event reporting in WSANs. We argue that the reliability in such a real-time system depends not only on the accuracy, but also the importance and freshness of the reported data. Our design follows this argument and seamlessly integrates three key modules that process the event data, namely, an efficient and fault-tolerant event data aggregation algorithm, a delay-aware data transmission protocol, and an adaptive actuator allocation algorithm for unevenly distributed events. Our transmission protocol also adopts smart priority scheduling that differentiates the event data of non-uniform importance. We evaluate our framework through extensive simulations, and the results demonstrate that it achieves desirable reliability with minimized delay","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126792183","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":"PLUS: Parameterized and Localized trUst management Scheme for sensor networks security","authors":"Zhiying Yao, Daeyoung Kim, Y. Doh","doi":"10.1109/MOBHOC.2006.278584","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278584","url":null,"abstract":"The wireless and resource-constraint nature of a sensor network makes it an ideal medium for attackers to do any kinds of vicious things. In this paper, we describe PLUS, a parameterized and localized trust management scheme for sensor networks security, where each sensor node maintains highly abstracted parameters, rates the trustworthiness of its interested neighbors to adopt appropriate cryptographic methods, identify the malicious nodes, and share the opinion locally. Results of a serious of simulation experiments show that the proposed scheme can maximize security as well as minimize energy consumption for sensor networks. And also, the secure routing proposed based on PLUS shows its benefit and feasibility","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123454122","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}
Ai Chen, Dongwook Lee, Gayathri Chandrasekaran, P. Sinha
{"title":"HIMAC: High Throughput MAC Layer Multicasting in Wireless Networks","authors":"Ai Chen, Dongwook Lee, Gayathri Chandrasekaran, P. Sinha","doi":"10.1109/MOBHOC.2006.278581","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278581","url":null,"abstract":"Efficient, scalable and robust multicasting support from the MAC layer is needed for meeting the demands of multicast based applications over WiFi and mesh networks. However, the IEEE 802.11 protocol has no specific mechanism for multicasting. It implements multicasting using broadcasting at the base transmission rate. We identify two fundamental reasons for performance limitations of this approach: (a) Channel-state indifference: irrespective of the current quality of the channel to the receivers, the transmission always uses the base transmission rate; (b) Demand ignorance: packets are transmitted by a node even if children in the multicast tree have received those packets by virtue of overhearing. We propose a solution for MAC layer multicasting called HIMAC that uses the following two mechanisms: unary channel feedback (UCF) and unary negative feedback (UNF) to respectively address the shortcomings of 802.11. Our study is supported by measurements in a testbed, and simulations. We observe that the end-to-end throughput of multicast sessions using MAODV can be increased by up to 74% while reducing the end-to-end latency by up to a factor of 56","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130103246","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}
M. S. Talebi, Mahdi Kefayati, B. Khalaj, H. Rabiee
{"title":"Adaptive Consensus Averaging for Information Fusion over Sensor Networks","authors":"M. S. Talebi, Mahdi Kefayati, B. Khalaj, H. Rabiee","doi":"10.1109/MOBHOC.2006.278610","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278610","url":null,"abstract":"This paper introduces adaptive consensus, a spatio-temporal adaptive method to improve convergence behavior of the current consensus fusion schemes. This is achieved by introducing a time adaptive weighting method for updating each sensor data in each iteration. Adaptive consensus method will improve node convergence rate, average convergence rate and the variance of error over the network. A mathematical formulation of the method according to the adaptive filter theory as well as derivation of the time adaptive weights and convergence conditions are presented. The analytical results are verified by simulation as well","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133571183","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":"Security and Energy Considerations for Routing in Hierarchical Optical Sensor Networks","authors":"U. N. Okorafor, Kyle Marshall, D. Kundur","doi":"10.1109/MOBHOC.2006.278670","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278670","url":null,"abstract":"In this paper we evaluate the energy and security consideration for a security-aware routing protocol proposed for uni-directional, hierarchical optical sensor network. We bootstrap the unconstrained resources of the base station to design GORA, a greedy optimized routing algorithm, in which the base station is responsible for network route optimization and updates. This paper extends our recent work on OPSENET, a novel and efficient protocol that facilitates secure routing in directional optical sensor networks. We evaluate security and energy metrics for our scheme proposed scheme. Analysis and simulation results are used to show the performance of our algorithm, compared with other hierarchical bi-directional clustering routing schemes","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124430448","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":"Bid Activation Multiple Access in Ad Hoc Networks","authors":"R. Ravindran, J. Garcia-Luna-Aceves","doi":"10.1109/MOBHOC.2006.278640","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278640","url":null,"abstract":"We present a new protocol for collision-free channel access in ad hoc networks called bid activation multiple access (BAMA). BAMA is based on bids made by nodes for slots within the context of probabilistic channel access. Winners of the bids for a given slot are determined as a result of a fair election of the bids for that slot. Nodes attempt to acquire varying number of slots depending on their traffic requirements. Nodes transmit their schedule information once in each frame prior to the data packet transmission in the slots acquired by them. Mismatched schedule information for a given slot are corrected based on the same fair election by the nodes that hear the schedule information. BAMA does not require explicit control information (HELLO packets) to build up local or global topology of the nodes to compute a transmission schedule for the nodes. The performance of BAMA is studied by simulations and compared against the performance of comparable protocols. It is found that BAMA provides better throughput and much lower end to end delay when compared to other protocols, both at low loads as well as high loads. The traffic adaptive nature of BAMA allows for the performance of BAMA to be largely independent of the network load. This makes it ideal for deployment in high bandwidth scenarios where low end to end delay is desirable","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116254960","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}