Medium access control for wireless sensor networks has been a very active research area in the recent years. The traditional wireless medium access control protocol such as IEEE 802.11 is not suitable for the sensor network application because these are battery powered. The recharging of these sensor nodes is expensive and also not possible. The most of the literature in the medium access for t...

Broadcasting nature of wireless communications makes it possible to apply opportunistic network coding (OPNC) by overhearing transmitted packets from a source to sink nodes. However, it is difficult to apply network coding to the topology of multiple relay and sink nodes. We propose to use relay node selection, which finds a proper node for network coding since the OPNC alone in the topology of...

It is well-known that the time taken for disseminating a large data object over a wireless sensor network is dominated by the overhead of resolving the contention for the underlying wireless channel. In this paper, we propose a new dissemination protocol called Splash, that eliminates the need for contention resolution by exploiting constructive interference and channel diversity to effectively...

In this paper, we introduce a new medium access control (MAC) protocol for event-driven wireless sensor networks (WSN). Generally, there are three models of WSN: continuous, on-demand and event-driven. They have different characteristics and each requires a different design model. In the event-driven WSN, the sensors send data only when certain events occur. Normally, the sensors do not have mu...

We address the problem of identifying misbehaving nodes that refuse to forward packets in wireless multi-hop networks. We map the process of locating the misbehaving nodes to the classic Rényi-Ulam game of 20 questions. Compared to previous methods, our mapping allows the evaluation of node behavior on a per-packet basis, without the need for energy-expensive overhearing techniques or intensive...

We adopt a form of group communication, called channeled multicast, for active rooms and other scenarios featuring strict real-time requirements, inherently unreliable communication, and a continuously changing set of context-aware autonomous systems. In our approach, rooted in multi-agent and team programming, coordination and cooperation are supported via “social awareness” and overhearing; a...

Ad-hoc On-Demand Distance Vector Routing (AODV) is a famous routing protocol for mobile ad hoc networks. Routing path established with AODV remains unchanged during data transmission unless the link fails. Due to the mobile nature of nodes in an ad hoc network, the network topology changes frequently. As a result, some intermediate nodes of an earlier established path may later become redundant...

Routing packets in mobile ad hoc networks has been considered to a great extent, even though the hypothesis on full connectivity is generally not valid in a real time system which means that a practical routing protocol ought to handle intermittent connectivity and the absence of end-to-end connections. In this paper, we propose a location aware routing mechanism called adaptive position based ...

Cooperative communication, which utilizes nearby terminals to relay the overhearing information to achieve the diversity gains, has a great potential to improve the transmitting efficiency in wireless networks. To deal with the complicated medium access interactions induced by relaying and leverage the benefits of such cooperation, an efficient Cooperative Medium Access Control (CMAC) protocol ...

Awareness of others’ interests can lead to fruitful collaborations, friendships and positive social change. Interviews of groups involved in both research and corporate work revealed a lack of awareness of shared interests among workers sharing an organizational affiliation and collocated in the same building or complex but still physically separated (e.g., by walls or floors). Our study showed...