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}
{"title":"Eavesdropping Minimization via Transmission Power Control in Ad-Hoc Wireless Networks","authors":"Jung-Chun Kao, R. Marculescu","doi":"10.1109/SAHCN.2006.288535","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288535","url":null,"abstract":"Reconnaissance activity is the most frequent incident on computer networks since 2002. In fact, most attacks (including DoS attacks) are usually preceded by reconnaissance activity. In order to defend against reconnaissance activity in ad-hoc wireless networks, we propose to use transmission power control as an effective mean to minimize the eavesdropping risk. Our main contributions are as follows: first, we cast the w-th order eavesdropping risk as the maximum probability of packets being eavesdropped when there are w adversarial nodes in the network. Second, we derive the closed-form solution of the 1st order eavesdropping risk as a 3rd-order polynomial function of normalized transmission radius. This derivation is based on the recently proposed model by El Gamal which assumes a uniform distribution of user nodes. Then we generalize the model to allow arbitrary user nodes distribution and prove that the uniform user distribution actually minimizes the 1st order eavesdropping risk. This result plays an essential role in deriving the first analytical bounds for the eavesdropping risk given arbitrary user distribution. Our simulation results show that for a wide range of non-uniform traffic patterns, the eavesdropping risk has the same order of magnitude as the corresponding uniform traffic cases","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"10 1","pages":"707-714"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88204485","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":"Search-quality Tradeoffs for Routing in Non-ideal Wireless Networks","authors":"C. Buragohain, D. Agrawal, S. Suri","doi":"10.1109/SAHCN.2006.288404","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288404","url":null,"abstract":"Typical wireless routing protocols like AODV/DSR are not scalable to very large networks because they employ flooding for route discovery. Geographic routing protocols like GPSR are highly scalable because they require minimum control overhead, but depend on idealized link quality models (such as the unit disk model) which are not always applicable. We explore the routing spectrum between these two extremes under a realistic random link quality model. It is common wisdom that by adding limited flooding to a protocol like geographic routing improves quality. In this paper, we provide a formal and quantitative formulation of this trade-off, and show both analytically and experimentally that a significant improvement in path quality is possible by searching a narrow region around the geographic straight-line path between the source and destination. In particular, if the end-to-end throughput is measured as the product of link reliabilities in a path, then we demonstrate that the path quality improves exponentially as the search region is broadened","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"72 1","pages":"10-19"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86258036","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":"Query Processing Optimization Through Sample Size and Monitoring Coverage Controlling in Wireless Sensor Networks","authors":"Qingchun Ren, Q. Liang","doi":"10.1109/SAHCN.2006.288568","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288568","url":null,"abstract":"Query processing has been studied extensively in traditional database systems. But few of existed methods can be directly applied to wireless sensor database systems due to their characteristics, such as decentralized nature, limited computational power, imperfect information recorded, and energy scarcity of individual sensor nodes. In this paper, we extend our previous work: quality-guaranteed and energy-efficient algorithm (QGEE) for wireless sensor database systems. We introduce radius of covering disk from point spread function (PSF) aspect and sample size for query quality and energy consumption control. PSF introduces ambiguity into query answers, since the sensitivity of nodes is nonuniform within monitoring region. Sample size determination refers to the process of determining exactly how many samples should be measured in order that the sampling distribution of estimators meets users' pre-specified target precision. In this paper, we formulate the criteria to determine the optimum radius and sample size according to users' requirements on query answers. Simulation results demonstrate that the impact of sample size and monitoring coverage on query answers in terms of root mean square error (RMSE)","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"15 1","pages":"830-834"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82742304","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}