Learn More
Localization, an important challenge in wireless sensor networks , is the process of sensor nodes self-determining their position. The difficulty encountered is in cost-effectively providing acceptable accuracy in localization. The potential for the deployment of high density networks in the near future makes scalability a critical issue in localiza-tion.(More)
Wireless sensor network applications require both energy-efficiency and low latency for reporting urgent but rare events. Various wakeup scheduling schemes have been proposed to save energy by employing duty cycles and to reduce end-to-end delay by synchronizing nodes' wakeup times and shortening setup latencies. Most sensor applications incur a predominant(More)
©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract— Wireless(More)
— Mobile Ad-hoc networks are inherently prone to security attacks, with node mobility being the primary cause in allowing security breaches. This makes the network susceptible to Byzantyne faults with packets getting misrouted, corrupted or dropped. In this paper we propose solutions using an unobtrusive monitoring technique using the " Detection Manager "(More)
Bluetooth is a promising new wireless technology that enables portable devices to form short-range multi-hop wireless ad-hoc networks. Bluetooth Scatternet Formation is one of the challenges that needs to be resolved. In this paper, we present a new, distributed Bluetooth mesh scatternet formation algorithm. The generated scatternet is a connected mesh(More)
AVL (Adel’son-Vel’skii and Landis) trees are efficient data structures for implementing dictionaries. We present a parallel dictionary, using AVL trees, on the EREW PRAM by proposing optimal algorithms to perform k operations with p (1 ≤ p ≤ k) processors. An explicit processor scheduling is devised to avoid simultaneous reads in our parallel algorithm to(More)