The deployment of wearable or body-worn devices is increasing rapidly, and thus researchers’ interests mainly include technical and economical issues, such as networking, interoperability, security, power optimization, business growth and regulation. To address these issues properly, previous survey papers usually focused on describing the wireless body area network architecture and network protocols. This implies that deployment issues and awareness issues of wearable and BAN devices are not emphasized in previous work. To defeat this problem, in this study, we have focused on feasibility, limitations, and security concerns in wireless body area networks. In the aspect of the economy, we have focused on the compound annual growth rate of these devices in the global market, different regulations of wearable/wireless body area network devices in different regions and countries of the world and feasible research projects for wireless body area networks. In addition, this study focuses on the domain of devices that are equally important to physicians, sportsmen, trainers and coaches, computer scientists, engineers, and investors. The outcomes of this study relating to physicians, fitness trainers and coaches indicate that the use of these devices means they would be able to treat their clients in a more effective way. The study also converges the focus of businessmen on the Annual Growth Rate (CAGR) and provides manufacturers and vendors with information about different regulatory bodies that are monitoring and regulating WBAN devices. Therefore, by providing deployment issues in the aspects of technology and economy at the same time, we believe that this survey can serve as a preliminary material that will lead to more advancements and improvements in deployment in the area of wearable wireless body area networks. Finally, we present open issues and further research direction in the area of wireless body area networks.
Mobile ad hoc networks consist of wireless nodes and can be established quickly with minimal configuration and cost, because, they do not require any infrastructure in advance. Civil and military applications are using them extensively in emergency and mission-oriented scenarios respectively as multi-party communication systems. Whereas, the multi-party secret key acquisition is one of the acute issues in these low resource wireless ad hoc networks, especially, which are based on IEEE 802.11ah and IEEE 802.11ba (low power WiFi), IEEE 802.15.4(Zigbee), BLE, IEEE 802.15.6 (body-worn or wearable) devices. In this study, a novel low cost and robust approach has been proposed and tested to establish an identical secret key in a multiuser mobile ad hoc environment. We believe, it is one of the groundbreaking contributions toward establishing a cost-effective secret key acquisition solution with respect to memory, computation, and bandwidth. We have used Bloom-Filters to cope with these resource limitations of such wireless setups. The proposed approach has been tested using IEEE 802.11 adapters in a real environment, and we found it to be highly suitable for wireless resource-limited applications. INDEX TERMS Dynamic secret, ephemeral secrets, shared secret, wireless networks, bloom filter, mobile ad hoc networks.
Abstract-Routing layer is one of the most important layers of the network stack. In wireless ad hoc networks, it becomes more significant because nodes act as relay nodes or routers in the network. This characteristic puts them at risk of routing attacks. A wormhole is the most treacherous attack on a routing layer of wireless ad hoc networks. The present proposed techniques require extra hardware, clock synchronization; or they make restrict assumption to deal with this attack. We have proposed a simple behavior-based approach which uses a small amount of memory for recording a few packets received and sent by the neighboring nodes. From this information, a behavior of these nodes is detected, that is, whether the behavior is benign or malicious. Nodes exhibiting malicious behavior are placed in the blocked node list. Malicious nodes are broadcasted in the network. None of the legal nodes in the network entertains any packet from these nodes. This approach has been simulated and verified in ns2.30 which detects and isolates wormhole nodes successfully. The current study focuses on the looping behavior of this attack.
The wormhole attack is one of the most treacherous attacks projected at the routing layer that can bypass cryptographicmeasures and derail the entire communication network. It is too difficult to prevent a priori; all the possible countermeasures are either too expensive or ineffective. Indeed, literature solutions either require expensive hardware (typically UWB or secure GPStransceivers) or pose specific constraints to the adversarial behavior (doing or not doing a suspicious action). The proposed solution belongs to the second category because the adversary is assumed to have done one or more known suspicious actions. In this solution, we adopt a heuristic approach to detect wormholes in ad hoc networks based on the detection of their illicit behaviors. Wormhole and post wormhole attacks are often confused in literature; that’s why we clearly state that our methodology does not provide a defence against wormholes, but rather against the actions that an adversary does after thewormhole, such as packet dropping, tampering with TTL, replaying and looping, etc. In terms of contributions, the proposed solution addresses the knock-out capability of attackers that is less targeted by the researcher’s community. In addition, it neither requires any additional hardware nor a change in it; instead, it is compatible with the existing network stack. The idea is simulated in ns2.30, and the average detection rate of the proposed solution is found to be 98-99%. The theoretical time to detect a wormhole node lies between 0.07-0.71 seconds. But, from the simulation, the average detection and isolation time is 0.67 seconds. In term of packet loss, the proposed solution has a relatively overhead of ≈ 22%. It works well in static and mobile scenarios, but the frame losses are higher in mobile scenarios as compared to static ones. The computational complexity of the solution is O(n). Simulation results advocate that the solution is effective in terms of memory, processing, bandwidth, and energy cost. The solution is validated using statistical parameters such as Accuracy, Precision, F1-Score andMatthews correlation coefficient (Mcc).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.