Mobile ad hoc network requires lots of attention towards secure reputed routing. This paper proposed a novel reputed e-ARAN scheme to detect and handle authenticated selfish nodes, based on reputed OCEAN scheme. With description of all four phases of reputed e-ARAN it also proves that the proposed scheme gives better end-to-end delay and throughput as […]
Optimizing throughput with reduction in power consumption and performance comparison of DSR and AODV routing protocols
The main objective of the paper is to increase the throughput thereby reducing the Network Load and end to end delay between nodes. To achieve this, it is proposed to go for reactive routing protocols. Proactive routing protocols use table-driven strategy that is the routing tables are exchanged periodically between nodes which lead to more […]
SPOC: A Secure and Privacy-Preserving Opportunistic Computing Framework for Mobile-Healthcare Emergency
With the pervasiveness of smart phones and the advance of wireless body sensor networks (BSNs), mobile Healthcare (m-Healthcare), which extends the operation of Healthcare provider into a pervasive environment for better health monitoring, has attracted considerable interest recently. However, the flourish of m-Healthcare still faces many challenges including information security and privacy preservation. In this […]
Making Sensor Networks Immortal: An Energy-Renewal Approach With Wireless Power Transfer
Wireless sensor networks are constrained by limited battery energy. Thus, finite network lifetime is widely regarded as a fundamental performance bottleneck. Recent breakthrough in the area of wireless power transfer offers the potential of removing this performance bottleneck, i.e., allowing a sensor network to remain operational forever. In this paper, we investigate the operation of […]
Timescale Decoupled Routing and Rate Control in Intermittently Connected Networks
We study an intermittently connected network (ICN) composed of multiple clusters of wireless nodes. Within each cluster, nodes can communicate directly using the wireless links. However, these clusters are far away from each other such that direct communication between the clusters is impossible except through “mobile” contact nodes. These mobile contact nodes are data carriers […]
Efficient Algorithms for Neighbor Discovery in Wireless Networks
Neighbor discovery is an important first step in the initialization of a wireless ad hoc network. In this paper, we design and analyze several algorithms for neighbor discovery in wireless networks. Starting with a single-hop wireless network of $n$ nodes, we propose a $Theta(nln n)$ ALOHA-like neighbor discovery algorithm when nodes cannot detect collisions, and […]
Low-complexity Scheduling Algorithms for Multi-channel Downlink Wireless Networks
This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, while the classical MaxWeight algorithm is known to be throughput-optimal, its buffer-overflow performance is very poor (formally, we show it has zero rate function in our setting). To address this, we propose […]
The Intrusion Detection in Mobile Sensor Network
Intrusion detection is an important problem in sensor networks. Prior works in static sensor environments show that constructing sensor barriers with random sensor deployment can be effective for intrusion detection. In response to the recent surge of interest in mobile sensor applications, this paper studies the intrusion detection problem in a mobile sensor network, where […]