7,831 research outputs found
Security and Privacy Issues in Wireless Mesh Networks: A Survey
This book chapter identifies various security threats in wireless mesh
network (WMN). Keeping in mind the critical requirement of security and user
privacy in WMNs, this chapter provides a comprehensive overview of various
possible attacks on different layers of the communication protocol stack for
WMNs and their corresponding defense mechanisms. First, it identifies the
security vulnerabilities in the physical, link, network, transport, application
layers. Furthermore, various possible attacks on the key management protocols,
user authentication and access control protocols, and user privacy preservation
protocols are presented. After enumerating various possible attacks, the
chapter provides a detailed discussion on various existing security mechanisms
and protocols to defend against and wherever possible prevent the possible
attacks. Comparative analyses are also presented on the security schemes with
regards to the cryptographic schemes used, key management strategies deployed,
use of any trusted third party, computation and communication overhead involved
etc. The chapter then presents a brief discussion on various trust management
approaches for WMNs since trust and reputation-based schemes are increasingly
becoming popular for enforcing security in wireless networks. A number of open
problems in security and privacy issues for WMNs are subsequently discussed
before the chapter is finally concluded.Comment: 62 pages, 12 figures, 6 tables. This chapter is an extension of the
author's previous submission in arXiv submission: arXiv:1102.1226. There are
some text overlaps with the previous submissio
An altruistic cross-layer recovering mechanism for ad hoc wireless networks
Video streaming services have restrictive delay and bandwidth constraints. Ad hoc networks represent a hostile environment for this kind of real-time data transmission. Emerging mesh networks, where a backbone provides more topological stability, do not even assure a high quality of experience. In such scenario, mobility of terminal nodes causes link breakages until a new route is calculated. In the meanwhile, lost packets cause annoying video interruptions to the receiver. This paper proposes a new mechanism of recovering lost packets by means of caching overheard packets in neighbor nodes and retransmit them to destination. Moreover, an optimization is shown, which involves a video-aware cache in order to recover full frames and prioritize more significant frames. Results show the improvement in reception, increasing the throughput as well as video quality, whereas larger video interruptions are considerably reduced. Copyright © 2014 John Wiley & Sons, Ltd.Arce Vila, P.; Guerri Cebollada, JC. (2015). An altruistic cross-layer recovering mechanism for ad hoc wireless networks. Wireless Communications and Mobile Computing. 15(13):1744-1758. doi:10.1002/wcm.2459S174417581513Li J Blake C De Couto DSJ Lee HI Morris R Capacity of ad hoc wireless networks Proceedings of the 7th Annual International Conference on Mobile Computing and Networks (MobiCom) 2001 61 69Akyildiz, I. F., & Xudong Wang. (2005). A survey on wireless mesh networks. IEEE Communications Magazine, 43(9), S23-S30. doi:10.1109/mcom.2005.1509968Hsu, C.-J., Liu, H.-I., & Seah, W. K. G. (2011). Opportunistic routing – A review and the challenges ahead. Computer Networks, 55(15), 3592-3603. doi:10.1016/j.comnet.2011.06.021Huang, X., Zhai, H., & Fang, Y. (2008). Robust cooperative routing protocol in mobile wireless sensor networks. IEEE Transactions on Wireless Communications, 7(12), 5278-5285. doi:10.1109/t-wc.2008.060680Wieselthier, J. E., Nguyen, G. D., & Ephremides, A. (2001). Mobile Networks and Applications, 6(3), 251-263. doi:10.1023/a:1011478717164Clausen T Jacquet P Optimized Link State Routing Protocol (OLSR), IETF RFC 3626 2003 http://www.rfc-editor.org/rfc/rfc3626.txtMarina, M. K., & Das, S. R. (2006). Ad hoc on-demand multipath distance vector routing. Wireless Communications and Mobile Computing, 6(7), 969-988. doi:10.1002/wcm.432Zhou X Lu Y Ma HG Routing improvement using multiple disjoint paths for ad hoc networks International Conference on Wireless and Optical Communications Networks (IFIP) 2006 1 5Fujisawa H Minami H Yamamoto M Izumi Y Fujita Y Route selection using retransmission packets for video streaming on ad hoc networks IEEE Conference on Radio and Wireless Symposium (RWS) 2006 607 610Badis H Agha KA QOLSR multi-path routing for mobile ad hoc networks based on multiple metrics: bandwidth and delay IEEE 59th Vehicular Technology Conference (VTC) 2004 2181 2184Wu Z Wu J Cross-layer routing optimization for video transmission over wireless ad hoc networks 6th International Conference on Wireless Communications Networks and Mobile Computing (WiCOM) 2010 1 6Schier, M., & Welzl, M. (2012). Optimizing Selective ARQ for H.264 Live Streaming: A Novel Method for Predicting Loss-Impact in Real Time. IEEE Transactions on Multimedia, 14(2), 415-430. doi:10.1109/tmm.2011.2178235Nikoupour M Nikoupour A Dehghan M A cross-layer framework for video streaming over wireless ad-hoc networks 3rd International Conference on Digital Information Management (ICDIM) 2008 340 345Yamamoto R Miyoshi T Distributed retransmission method using neighbor terminals for ad hoc networks Proceedings of the 14th Asia-Pacific Conference on Communications (APCC) 2008 1 5Gravalos I Kokkinos P Varvarigos EA Multi-criteria cooperative energy-aware routing in wireless ad-hoc networks Proceedings of the 9th International Wireless Communications and Mobile Computing Conference (IWCMC) 2013 387 393Abid, R. M., Benbrahim, T., & Biaz, S. (2010). IEEE 802.11s Wireless Mesh Networks for Last-Mile Internet Access: An Open-Source Real-World Indoor Testbed Implementation. Wireless Sensor Network, 02(10), 725-738. doi:10.4236/wsn.2010.210088Yen, Y.-S., Chang, R.-S., & Wu, C.-Y. (2011). A seamless handoff scheme for IEEE 802.11 wireless networks. Wireless Communications and Mobile Computing, 13(2), 157-169. doi:10.1002/wcm.1102Liangzhong Yin, & Guohong Cao. (2006). Supporting cooperative caching in ad hoc networks. IEEE Transactions on Mobile Computing, 5(1), 77-89. doi:10.1109/tmc.2006.15Biswas S Morris R ExOR: opportunistic multi-hop routing for wireless networks Proceedings of ACM SIGCOMM 2005 133 144Chachulski S Jennings M Katti S Katabi D Trading structure for randomness in wireless opportunistic routing Proceedings of ACM SIGCOMM 2007 169 180Kohler E Handley M Floyd S Datagram Congestion Control Protocol (DCCP), IETF RFC 4340 2006 http://www.rfc-editor.org/rfc/rfc4340.txtSchierl, T., Ganger, K., Hellge, C., Wiegand, T., & Stockhammer, T. (2006). SVC-based multisource streaming for robust video transmission in mobile ad hoc networks. IEEE Wireless Communications, 13(5), 96-103. doi:10.1109/wc-m.2006.250365Iera, A., Molinaro, A., Paratore, S. Y., Ruggeri, G., & Zurzolo, A. (2011). Making a mesh router/gateway from a smartphone: Is that a practical solution? Ad Hoc Networks, 9(8), 1414-1429. doi:10.1016/j.adhoc.2011.03.00
Energy Efficient Clustering and Routing in Mobile Wireless Sensor Network
A critical need in Mobile Wireless Sensor Network (MWSN) is to achieve energy
efficiency during routing as the sensor nodes have scarce energy resource. The
nodes' mobility in MWSN poses a challenge to design an energy efficient routing
protocol. Clustering helps to achieve energy efficiency by reducing the
organization complexity overhead of the network which is proportional to the
number of nodes in the network. This paper proposes a novel hybrid multipath
routing algorithm with an efficient clustering technique. A node is selected as
cluster head if it has high surplus energy, better transmission range and least
mobility. The Energy Aware (EA) selection mechanism and the Maximal Nodal
Surplus Energy estimation technique incorporated in this algorithm improves the
energy performance during routing. Simulation results can show that the
proposed clustering and routing algorithm can scale well in dynamic and energy
deficient mobile sensor network.Comment: 9 pages, 4 figure
Self-stabilizing cluster routing in Manet using link-cluster architecture
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a single special node, called a clusterhead that contains the routing information about inter and intra-cluster communication. A cluster is comprised of all nodes that choose the corresponding clusterhead as their leader. The algorithm consists of two main tasks. First, the set of special nodes (clusterheads) is elected such that it models the link-cluster architecture: any node belongs to a single cluster, it is within two hops of the clusterhead, it knows the direct neighbor on the shortest path towards the clusterhead, and there exist no two adjacent clusterheads. Second, the routing tables are maintained by the clusterheads to store information about nodes both within and outside the cluster. There are two advantages of maintaining routing tables only in the clusterheads. First, as no two neighboring nodes are clusterheads (as per the link-cluster architecture), there is no need to check the consistency of the routing tables. Second, since all other nodes have significantly less work (they only forward messages), they use much less power than the clusterheads. Therefore, if a clusterhead runs out of power, a neighboring node (that is not a clusterhead) can accept the role of a clusterhead. (Abstract shortened by UMI.)
- …