scispace - formally typeset
Search or ask a question
Author

Amit Kumar Saha

Other affiliations: AT&T, Juniper Networks
Bio: Amit Kumar Saha is an academic researcher from Rice University. The author has contributed to research in topics: Routing protocol & Ad hoc wireless distribution service. The author has an hindex of 13, co-authored 19 publications receiving 1388 citations. Previous affiliations of Amit Kumar Saha include AT&T & Juniper Networks.

Papers
More filters
Proceedings ArticleDOI
01 Oct 2004
TL;DR: A new, realistic model of node motion based on the movement of vehicles on real street maps is presented, which is compared with the Random Waypoint mobility model, the most widely used mobility model.
Abstract: Without realistic modeling of node mobility, simulation evaluation of performance of mobile ad hoc networks may not correlate well with performance in a real deployment. In this work, we present a new, realistic model of node motion based on the movement of vehicles on real street maps. Our model can be used with the ns-2 network simulator. We compare our model with the Random Waypoint mobility model, the most widely used mobility model. Results show that, in many ways, the Random Waypoint mobility model is a good approximation for simulating the motion of vehicles on a road, but there are situations in which our new model is better suited.

465 citations

Proceedings ArticleDOI
01 May 2007
TL;DR: Simulation results in ns-2 show that RMAC achieves significant improvement in end-to-end delivery latency over S-MAC and can handle traffic contention much more efficiently than S- MAC, without sacrificing energy efficiency or network throughput.
Abstract: Duty-cycle MAC protocols have been proposed to meet the demanding energy requirements of wireless sensor networks. Although existing duty-cycle MAC protocols such as S-MAC are power efficient, they introduce significant end-to-end delivery latency and provide poor traffic contention handling. In this paper, we present a new duty-cycle MAC protocol, called RMAC (the routing enhanced MAC protocol), that exploits cross-layer routing information in order to avoid these problems without sacrificing energy efficiency. In RMAC, a setup control frame can travel across multiple hops and schedule the upcoming data packet delivery along that route. Each intermediate relaying node for the data packet along these hops sleeps and intelligently wakes up at a scheduled time, so that its upstream node can send the data packet to it and it can immediately forward the data packet to its downstream node. When wireless medium contention occurs, RMAC moves contention traffic away from the busy area by delivering data packets over multiple hops in a single cycle, helping to reduce the contention in the area quickly. Our simulation results in ns-2 show that RMAC achieves significant improvement in end-to-end delivery latency over S-MAC and can handle traffic contention much more efficiently than S-MAC, without sacrificing energy efficiency or network throughput.

365 citations

Proceedings ArticleDOI
26 Apr 2004
TL;DR: This work describes a probabilistic method for clock synchronization that uses the higher precision of receiver-to-receiver synchronization, as described in reference broadcast synchronization (RBS) protocol, and extends this protocol for maintaining clock synchronization in a multihop network.
Abstract: Recent advances in technology have made low cost, low power wireless sensors a reality. Clock synchronization is an important service in any distributed system, including sensor network systems. Applications of clock synchronization in sensor networks include data integration in sensors, sensor reading fusion, TDMA medium access scheduling, and power mode energy saving. However, for a number of reasons, standard clock synchronization protocols are unsuitable for direct application in sensor networks. In this paper, we introduce the concept of adaptive clock synchronization based on the need of the application and the resource constraint in the sensor networks. We describe a probabilistic method for clock synchronization that uses the higher precision of receiver-to-receiver synchronization, as described in Reference Broadcast Synchronization (RBS) protocol. This deterministic protocol is extended to provide a probabilistic bound on the accuracy of the clock synchronization, allowing for a tradeo between accuracy and resource requirement. Expressions to convert service specifications (maximum clock synchronization error and confidence probability) to actual protocol parameters (minimum number of messages and synchronization overhead) are derived. Further, we extend this protocol for maintaining clock synchronization in a multihop network.

175 citations

Proceedings ArticleDOI
29 Nov 2004
TL;DR: The initial design and evaluation of two techniques for routing improvement using directional antennas in mobile ad hoc networks are presented and the effectiveness of the design in the context of the dynamic source routing protocol (DSR) is demonstrated.
Abstract: In this paper, we present the initial design and evaluation of two techniques for routing improvement using directional antennas in mobile ad hoc networks. First, we use directional antennas to bridge permanent network partitions by adaptively transmitting selected packets over a longer distance, still transmitting most packets a shorter distance. Second, in a network without permanent partitions, we use directional antennas to repair routes in use, when an intermediate node moves out of wireless transmission range along the route; by using the capability of a directional antenna to transmit packets over a longer distance, we bridge the route breakage caused by the intermediate node's movement, thus reducing packet delivery latency. Through simulations, we demonstrate the effectiveness of our design in the context of the dynamic source routing protocol (DSR).

72 citations

Proceedings ArticleDOI
05 Nov 2007
TL;DR: An analytical model is introduced that accurately captures the 802.11 MAC protocol operation and predicts both throughput and delay of multi-hop flows under changing traffic load or routing decisions and proposes a novel routing metric that can be used to discover high throughput path in a congested network.
Abstract: We address the problem of identifying high throughput paths in 802.11 wireless mesh networks. We introduce an analytical model that accurately captures the 802.11 MAC protocol operation and predicts both throughput and delay of multi-hop flows under changing traffic load or routing decisions. The main idea is to characterize each link by the packet loss probability and by the fraction of busy time sensed by the link transmitter, and to capture both intra-flow and inter-flow interference. Our model reveals that the busy time fraction experienced by a node, a locally measurable quantity, is essential in finding maximum throughput paths. Furthermore, metrics that do not take this quantity into account can yield low throughput by routing over congested paths or by filtering-out non-congested paths. Based on our analytical model, we propose a novel routing metric that can be used to discover high throughput path in a congested network. Using city-wide mesh network topologies we demonstrate that our model-based metric can achieve significant performance gains with respect to existing metrics.

70 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: This paper presents a detailed study on recent advances and open research issues in WMNs, followed by discussing the critical factors influencing protocol design and exploring the state-of-the-art protocols for WMNs.

4,205 citations

Journal ArticleDOI
TL;DR: The hybrid simulation framework Veins (Vehicles in Network Simulation), composed of the network simulator OMNeT++ and the road traffic simulator SUMO, is developed and can advance the state-of-the-art in performance evaluation of IVC and provide means to evaluate developed protocols more accurately.
Abstract: Recently, many efforts have been made to develop more efficient Inter-Vehicle Communication (IVC) protocols for on-demand route planning according to observed traffic congestion or incidents, as well as for safety applications. Because practical experiments are often not feasible, simulation of network protocol behavior in Vehicular Ad Hoc Network (VANET) scenarios is strongly demanded for evaluating the applicability of developed network protocols. In this work, we discuss the need for bidirectional coupling of network simulation and road traffic microsimulation for evaluating IVC protocols. As the selection of a mobility model influences the outcome of simulations to a great extent, the use of a representative model is necessary for producing meaningful evaluation results. Based on these observations, we developed the hybrid simulation framework Veins (Vehicles in Network Simulation), composed of the network simulator OMNeT++ and the road traffic simulator SUMO. In a proof-of-concept study, we demonstrate its advantages and the need for bidirectionally coupled simulation based on the evaluation of two protocols for incident warning over VANETs. With our developed methodology, we can advance the state-of-the-art in performance evaluation of IVC and provide means to evaluate developed protocols more accurately.

1,356 citations

Journal ArticleDOI
TL;DR: The research challenge of routing in VANETs is discussed and recent routing protocols and related mobility models for VANets are surveyed.
Abstract: Vehicular ad hoc network (VANET) is an emerging new technology integrating ad hoc network, wireless LAN (WLAN) and cellular technology to achieve intelligent inter-vehicle communications and improve road traffic safety and efficiency. VANETs are distinguished from other kinds of ad hoc networks by their hybrid network architectures, node movement characteristics, and new application scenarios. Therefore, VANETs pose many unique networking research challenges, and the design of an efficient routing protocol for VANETs is very crucial. In this article, we discuss the research challenge of routing in VANETs and survey recent routing protocols and related mobility models for VANETs.

1,147 citations

Journal ArticleDOI
01 May 2005
TL;DR: In this paper, a survey and evaluation of clock synchronization protocols based on a palette of factors such as precision, accuracy, cost, and complexity is presented, which can help developers either in choosing an existing synchronization protocol or in defining a new protocol that is best suited to the specific needs of a sensor network application.
Abstract: Recent advances in micro-electromechanical (MEMS) technology have led to the development of small, low-cost, and low-power sensors Wireless sensor networks (WSNs) are large-scale networks of such sensors, dedicated to observing and monitoring various aspects of the physical world In such networks, data from each sensor is agglomerated using data fusion to form a single meaningful result, which makes time synchronization between sensors highly desirable This paper surveys and evaluates existing clock synchronization protocols based on a palette of factors like precision, accuracy, cost, and complexity The design considerations presented here can help developers either in choosing an existing synchronization protocol or in defining a new protocol that is best suited to the specific needs of a sensor-network application Finally, the survey provides a valuable framework by which designers can compare new and existing synchronization protocols

1,018 citations

Journal ArticleDOI
TL;DR: This work proposes several vehicle-assisted data delivery (VADD) protocols to forward the packet to the best road with the lowest data-delivery delay, and Experimental results show that the proposed VADD protocols outperform existing solutions in terms of packet-del delivery ratio, data packet Delay, and protocol overhead.
Abstract: Multihop data delivery through vehicular ad hoc networks is complicated by the fact that vehicular networks are highly mobile and frequently disconnected. To address this issue, we adopt the idea of carry and forward, where a moving vehicle carries a packet until a new vehicle moves into its vicinity and forwards the packet. Being different from existing carry and forward solutions, we make use of predictable vehicle mobility, which is limited by traffic pattern and road layout. Based on the existing traffic pattern, a vehicle can find the next road to forward the packet to reduce the delay. We propose several vehicle-assisted data delivery (VADD) protocols to forward the packet to the best road with the lowest data-delivery delay. Experimental results show that the proposed VADD protocols outperform existing solutions in terms of packet-delivery ratio, data packet delay, and protocol overhead. Among the proposed VADD protocols, the hybrid probe (H-VADD) protocol has a much better performance.

943 citations