{"title":"Modeling the Effect of BEB for a Hidden Terminal Topology from a New Perspective","authors":"A. Tsertou, D. Laurenson","doi":"10.1109/SAHCN.2006.288519","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288519","url":null,"abstract":"The last couple of years were characterised by the revival of interest in the performance evaluation of wireless multihop networks. An issue of great significance in carrier-sense based multihop networks is the hidden node problem. In our recent work we showed that previous techniques are suitable for limited node configurations and we proposed a novel time model that relaxes most assumptions in the literature and exhibits high accuracy of performance evaluation. The present paper extends our recent work, which was based on a constant contention window assumption, to the binary exponential backoff (BEB) mechanism of IEEE 802.11, with an equally high degree of agreement to simulation results. Key points of our analysis are the consideration of different collision probabilities, dependent on the backoff stage, and the use of a discrete time Markov chain embedded in the channel state evolution that allows us to compute the 'backoff-dwelling' distribution of each transmitter","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"2 1","pages":"607-614"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81918464","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":"Capacity Evaluation Framework and Validation of Self-Organized Routing Schemes","authors":"H. Rivano, Fabrice Théoleyre, F. Valois","doi":"10.1109/SAHCN.2006.288560","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288560","url":null,"abstract":"Assuming a given network topology and a routing protocol, this work is focused on the capacity evaluation of routing protocols based on either a self-organization scheme or a flat approach. To reach this goal, we propose to use linear-programming formulation to model radio resource sharing as linear constraints. Four models are detailed to evaluate the capacity of any routing scheme in wireless multihops networks. First, two models of fairness are proposed: either each node has a fair access to the channel, or the fairness is among the radio links. Besides, a pessimistic and an optimistic scenarios of spatial re-utilization of the medium are proposed, yielding a lower bound and an upper bound on the network capacity for each fairness case. Finally, using this model, we provide a comparative analysis of some flat and self-organized routing protocols","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"12 1","pages":"779-785"},"PeriodicalIF":0.0,"publicationDate":"2006-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78657899","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. Watteyne, A. Bachir, M. Dohler, D. Barthel, I. Augé-Blum
{"title":"1-hopMAC: An Energy-Efficient MAC Protocol for Avoiding 1 -hop Neighborhood Knowledge","authors":"T. Watteyne, A. Bachir, M. Dohler, D. Barthel, I. Augé-Blum","doi":"10.1109/SAHCN.2006.288524","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288524","url":null,"abstract":"Wireless sensor networks (WSNs) have witnessed a tremendous upsurge in recent years, both in academia and industry; this is mainly attributed to their unprecedented operating conditions and a variety of commercially viable applications. Because of their dependence on scarce battery power, communication protocols need to be energy efficient. However, finding the optimal solution is challenging as it needs to consider the whole communication stack at once. In this paper, we propose an approach that aims at optimizing jointly L2 (link) and L3 (routing) protocols. We design 1-hopMAC, a communication architecture grouping MAC and routing layers which avoids 1-hop neighborhood knowledge. 1-hopMAC can be combined, among others, with a geographic or gradient based routing protocols. We present an analytical study of energy consumption to point out the optimal configuration of 1-hopMAC","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"233 1","pages":"639-644"},"PeriodicalIF":0.0,"publicationDate":"2006-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75768192","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}
Bo Zhu, S. Jajodia, M. Kankanhalli, F. Bao, R. Deng
{"title":"An Anonymous Routing Protocol with The Local-repair Mechanism for Mobile Ad Hoc Networks","authors":"Bo Zhu, S. Jajodia, M. Kankanhalli, F. Bao, R. Deng","doi":"10.1109/SAHCN.2006.288411","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288411","url":null,"abstract":"In this paper, we first define the requirements on anonymity and security properties of the routing protocol in mobile ad hoc networks, and then propose a new anonymous routing protocol with the local-repair mechanism. Detailed analysis shows that our protocol achieves both anonymity and security properties defined. A major challenge in designing anonymous routing protocols is to reduce computation and communication costs. To overcome this challenge, our protocol is design to require neither asymmetric nor symmetric encryption/decryption while updating the flooding route requests; more importantly, once a route is broken, instead of re-launching a new costly flooding route discovery process like previous work, our protocol provides a local-repair mechanism to fix broken parts of a route without compromising anonymity","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"8 1","pages":"70-79"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73441082","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 Evaluation of Secure on-Demand Routing Protocols for Mobile Ad-hoc Networks","authors":"J. Arshad, M. A. Azad","doi":"10.1109/SAHCN.2006.288591","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288591","url":null,"abstract":"With the passage of time and increase in the need for mobility wireless or mobile networks emerged to replace the wired networks. This new generation of networks is different from the earlier one in many aspects like network infrastructure, resources and routing protocols, routing devices etc. These networks are bandwidth and resource constrained with no network infrastructure and dedicated routing devices. Moreover, every node in such networks has to take care of its routing module itself. These characteristics become reasons for the importance of security in mobile ad-hoc networks as there is very high probability of attacks in such networks. Some work has been done to compare different protocols on basis of security but keeping in view the resource limitations in such networks, evaluation based on networking context is also important. We evaluate the overall performance overhead associated with secure routing protocols for mobile ad-hoc networks (MANETs). We implement the secure ad-hoc on-demand distance vector routing protocol (SAODV) extensions with AODV in the network simulator 2 (NS-2) and use the Monarch project implementation of Ariadne for our evaluation purpose. We try to figure out the amount of extra work a mobile node has to do in order to operate securely","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"27 1","pages":"971-975"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73449031","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 spatio-temporal model for physical carrier sensing wireless ad-hoc networks","authors":"E. Wong, R. Cruz","doi":"10.1109/SAHCN.2006.288432","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288432","url":null,"abstract":"In this paper, we propose a simple analytic model for a physical carrier sensing wireless ad-hoc network. Attempted packet transmissions are modeled as a three dimensional Poisson point process in space and time. Each node measures the total interference power before an attempted transmission, and proceeds with the transmission only if the total interference power is below a threshold, called the idle threshold. A completed transmission is successfully received if the interference power at the intended destination is suitably low during the transmission. The total interference process is modeled as a shot noise that is a filtered in space and time, which accounts for an infinite number of concurrent transmissions on the infinite plane. We make a Gaussian approximation for the power of the interference process. A key mechanism for physical carrier sensing we take into account in our model is the inhibitory effect of nearby neighbors around an existing transmission. The inhibiting model is based on the threshold on the interference level rather than a geographically defined region. We model this effect using the conditional intensity of transmissions given an existing transmission, which can be solved using a system of two fixed point equations. We further approximate the conditional statistics of transmissions as Poisson to obtain a simpler model. We compare the predictions using the simpler model to Monte Carlo simulations results based on the model without the Poisson approximation, and we find a reasonably close match. Our results suggest the simpler model can be used as a guide to set the protocol parameters such as transmission attempts intensity, distance between the transmitter and its intended receiver, transmission power, packet duration, idle and packet detection threshold, in order to optimize network throughput","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"16 1","pages":"276-285"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73730396","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":"Joint Range and Load Considerations for Topology Control in Wireless Ad Hoc Networks","authors":"S. Zarifzadeh, A. Nayyeri, N. Yazdani","doi":"10.1109/SAHCN.2006.288503","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288503","url":null,"abstract":"Wireless ad hoc networks are usually composed of tiny and resource constraint devices, which make energy conservation a vital concern of their design. Reducing energy consumption has been addressed through different aspects till now. Topology control (TC) is a well-known approach which tries to assign the transmission ranges of nodes to optimize energy utilization while keeping some network properties like connectivity. However, in current TC schemes, the transmission range of each node is mostly accounted as the exclusive estimator for its energy consumption, while ignoring the amount of data it sends or relays. In this paper, we redefine the problem of topology control regarding both traffic load and transmission range parameters. After proving the NP-hardness of the new problem, we mathematically formulate it as a mixed integer linear programming problem to find the optimal solutions. Then, we introduce two polynomial-time heuristic algorithms to practically solve the problem. Finally, we show the advantages of our proposals through simulations","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"183 1","pages":"469-478"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74646077","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":"Resilient JPv6 Multicast Address Allocation in Ad Hoc Networks","authors":"J.K.O. Lindqvist, Antti Ylä-Jääski, J. Manner","doi":"10.1109/SAHCN.2006.288561","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288561","url":null,"abstract":"Multicast address allocation in the Internet has been the focus of much research and standardization. However, the multicast address allocation problem has been overlooked in ad hoc networking research. In this paper, we survey approaches to solving the multicast address allocation problem and analyze the security characteristics of the proposals. We show that using random assignment in IPv6 based ad hoc networks for multicast address allocation is more secure and bandwidth efficient than the previous proposals. We use passive listening to obtain network prefixes for autoconfiguring a global multicast address. The ideas presented in this paper are useful for practical deployment of ad hoc networks","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"43 1","pages":"786-791"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77597976","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":"Hybrid Wireless Networks: Applications, Architectures and New Perspectives","authors":"Christian Tchepnda, H. Moustafa, H. Labiod","doi":"10.1109/SAHCN.2006.288571","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288571","url":null,"abstract":"With the advent and ubiquitous of wireless technology, a wide range of advanced services are expected to be supported including appealing services that currently exist in wired systems. Nevertheless, the resource constraints in wireless environment may render difficulty to realizing all the desirable services. Consequently, an infrastructure with high data rate is necessary to complement the resource constraints and to act as anchor points linking mobile nodes to other fixed networks as the Internet. Hybrid wireless networks have emerged as a promising solution, allowing mobile clients to achieve higher performance and service access in a seamless manner independent of their existence in wireless LAN (WLAN) communication range. In this paper we address the benefits of hybrid wireless networks, showing their possible applications and presenting a classification for their emerging architectures. Also, we identify the research challenge arising from the problem of applying the grid computing concept in such hybrid wireless environment, showing the expected benefits from the aggregated fixed-mobile capacity. Finally, we propose our vision for a potential architectural model, which is expected to provide useful services by the network operator or the service provider in such a hybrid environment","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"54 1","pages":"848-853"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80056010","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":"Code Dissemination in Sensor Networks with MDeluge","authors":"Xia Zh, B. Sarikaya","doi":"10.1109/SAHCN.2006.288527","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288527","url":null,"abstract":"In today's wireless sensor networks there is a need to improve macro programming of the sensor nodes so that sensor nodes can execute various applications in a flexible manner. There is a need to contribute to macro programming of wireless sensor networks by developing new code dissemination techniques which can disseminate the code into designated sensor nodes. We present a new algorithm called multicast deluge (MDeluge) which can be used to disseminate the code image into a designated subnet of a wireless sensor network. MDeluge disseminates code in the sensor network using a tree which is formed when the sensor nodes send code request messages. Micro server keeps the code and sends it based on the requests. MDeluge disseminates binary code as well as capsules of Mate. We extend MDeluge for the sensor networks that are geographically distributed and that have moving nodes. Assuming a grid structured wireless sensor network we present an analysis of various message costs as well as the overall cost of data messages of MDeluge. Simulation of MDeluge shows that MDeluge performs better than Deluge to disseminate the code into designated sensor nodes","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"38 1","pages":"661-666"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80845643","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}