|An Acknowledgment-Based Approach for the Detection of Routing Misbehavior in MANETs
||We study routing misbehavior in MANETs (Mobile Ad Hoc Networks) in this paper. In general, routing protocols for
MANETs are designed based on the assumption that all participating nodes are fully cooperative. However, due to the open structure
|Analyzing Multi-Channel Medium Access Control Schemes With ALOHA Reservation
||In order to improve the throughput performance
of Medium Access Control (MAC) schemes in wireless communication networks, some researchers proposed to divide a single shared channel into several sub-channels: one as control subchannel
and the other...
|Analyzing Split Channel Medium Access Control Schemes
||In this work, we analyze and evaluate the maximum
achievable throughput of split-channel MAC schemes that are
based on the RTS/CTS (Ready-To-Send/Clear-To-Send) dialogue
and that rely on pure ALOHA or on p-persistent Carrier Sensing
|Broadcast Scheduling in Interference Environment
||Broadcast is a fundamental operation in wireless networks, and nai¨ve flooding is not practical, because it cannot deal
with interference. Scheduling is a good way of avoiding interference, but previous studies on broadcast scheduling algorithms all...
|Can Multiple Subchannels Improve the Delay Performance of RTS/CTS-based MAC Schemes?
||We analyze the delay performance of RTS/CTSbased
(Request-To-Send/Clear-To-Send) multi-channel MAC
(Medium Access Control) schemes for wireless networks. These
schemes usually employ multiple data subchannels for data
transmission and one control...
|Dual Busy Tone Multiple Access (DBTMA)— A Multiple Access Control Scheme for Ad Hoc Networks
||In ad hoc networks, the hidden- and the exposed-terminal
problems can severely reduce the network capacity on
the MAC layer. To address these problems, the ready-to-send
and clear-to-send (RTS/CTS) dialogue has been proposed in
the literature. Ho...
|Evaluating Opportunistic Multi-Channel MAC: Is Diversity Gain Worth the Pain?
||We evaluate the performance of an opportunistic multi-channel medium access control protocol and compare it to that of the corresponding single-channel MAC (S-MAC) and a non-opportunistic multi-channel MAC (M-MAC). We do this in three different setti...
|Fast Authentication in Multi-Hop Infrastructure-based Communication
||Multi-hop infrastructure-based communication is expected to play a vital role in supporting high data-rate multimedia access to mobile devices. The advantages are significant in highly mobile scenarios such as intra-vehicular networks. However, mobil...
|INSENS: Intrusion-tolerant routing for wireless sensor networks
||This paper describes an INtrusion-tolerant routing protocol for wireless SEnsor NetworkS (INSENS). INSENS securely and efficiently constructs tree-structured routing for wireless sensor networks (WSNs). The key objective of an INSENS network is to to...
|A Key Predistribution Scheme for Sensor Networks Using Deployment Knowledge
||To achieve security in wireless sensor networks, it is important to be able to encrypt messages sent among sensor nodes.
Keys for encryption purposes must be agreed upon by communicating nodes. Due to resource constraints, achieving such key
|Medium Access Control Protocols for Ad-Hoc Wireless Networks: A Survey
||Studies of ad hoc wireless networks are a relatively new field gaining more popularity for various new applications. In these networks, the Medium Access Control (MAC) protocols are responsible for coordinating the access from active nodes. These pro...
|Multi-hop/Direct Forwarding (MDF) for Static Wireless Sensor Networks
||The success of Wireless Sensor Networks (WSNs) depends largely on efficient information delivery from target areas toward data sinks. The problem of data forwarding is complicated by the severe energy constraints of sensors in WSNs. In this work, we ...
|Multipath Key Establishment for Wireless Sensor Networks Using Just-Enough Redundancy Transmission
||In random key predistribution techniques for wireless sensor networks, a relatively small number of keys are randomly
chosen from a large key pool and are loaded on the sensors prior to deployment. After deployment, each sensor tries finding a
|On Optimizing the Backoff Interval for Random Access Schemes
||To improve the channel throughput and the fairness
of random access channels, we propose a new backoff algorithm,
namely, the sensing backoff algorithm (SBA). A novel feature of
the SBA scheme is the sensing mechanism, in which every node
|On search sets of expanding ring search in wireless networks
||We focus on the problem of finding the best search set for expanding ring search (ERS) in wireless networks. ERS is widely used to locate randomly selected destinations or information in wireless networks such as wireless sensor networks In ERS, cont...
|Online Price Dispersion Revisited: How Do Transaction Prices Differ from Listing Prices?
||Price dispersion of a homogeneous product reflects market efficiency and has significant implications on sellers’ pricing strategies. Two different perspectives, the supply and demand perspectives, can be adopted to examine this phenomenon. The forme...
|Optimal Transmission Range for Wireless Ad Hoc Networks Based on Energy Efficiency
||The transmission range that achieves the most economical
use of energy in wireless ad hoc networks is studied for
uniformly distributed network nodes. By assuming the existence
of forwarding neighbors and the knowledge of their locations, the
|A Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks
||To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent between sensor nodes. Before doing so, keys for performing encryption and authentication must be agreed upon by the communicating pa...
|Scheduling Sleeping Nodes in High Density Cluster-based Sensor Networks
||In order to conserve battery power in very dense sensor networks, some sensor nodes may be put into the sleep state while other sensor nodes remain active for the sensing and communication tasks. In this paper, we study the node sleep scheduling prob...
|Selection of a Forwarding Area for Contention-Based Geographic Forwarding in Wireless Multi-Hop Networks
||Contention-based Geographic Forwarding (CGF) is
a state-free forwarding technique. In this paper, we develop a
general analytical framework to evaluate the performance of CGF
with different forwarding areas in wireless multi-hop networks. In
|Time-slotted voting mechanism for fusion data assurance in wireless sensor networks under stealthy attacks
||In wireless sensor networks, data fusion is often performed in order to reduce the overall message transmission from the sensors toward the base station. We investigate the problem of data fusion assurance in multi-level data fusion or transmission i...