Suvadip Batabyal

Road traffic congestion monitoring and measurement using active RFID and GSM technology

In this paper, we present an intelligent Traffic Congestion Monitoring & Measurement System called TrafficMonitor to monitor and measure the road traffic congestions using probe vehicle. The concept of probe vehicle has come up in recent times for collecting real time traffic data. Our system provides an easy platform to analyze the traffic movement and congestion pattern. TrafficMonitor is a rapidly deployable, cost-effective and easily maintainable traffic congestion monitoring & measurement system that combines active RFID (based on IEEE 802.15.4 protocol, 2.4 GHz ISM band) and GSM technologies. The congestion detection algorithm is based upon calculation of vehicular speed over a stretch of road and the average waiting time of vehicles at road-crossing. Besides providing a complete description of our system and the concepts developed, the paper also provides a comprehensive description of on-road test results to support our concepts. We also provide a detailed description of all the field trials conducted, various traffic data gathered and finally the conclusions derived from such data. Government agencies, especially traffic control department, may use this system for realtime congestion monitoring by installing the system with probe vehicles. Road research organizations and NGOs may use this for studying and analyzing traffic mobility and congestion patterns.

Mobility Models, Traces and Impact of Mobility on Opportunistic Routing Algorithms: A Survey

Mobile Opportunistic Network (MON) is characterized by intermittent connectivity where communication largely depends on the mobility pattern of the participating nodes. In MON, a node can take the custody of a packet for a long time and carry it until a new forwarding path has been established, unlike mobile adhoc network (MANET), where a node must drop the packet otherwise. Therefore, routing in MON depends on the repeated make-and-break of communication links, which again depends on the mobility of the nodes as they encounter and drift away from each other. MONs can simply be formed by humans carrying hand-held devices (like Personal Digital Assistant [PDAs] or cell phones) or on-board devices installed in vehicles. Therefore, with mobility playing a major role in the performance of MON, researchers have repeatedly tried to understand the nature of mobility with respect to humans, vehicles, and wild animals. To study the nature of mobility, researchers have collected mobility traces, proposed mobility models, and analyzed the performance of MON with respect to various mobility parameters. This article provides a detailed survey of different mobility models which have been proposed to date and how mobility largely determines the performance of opportunistic routing. We divide the article into four major sections. First, we provide a detailed survey of all the synthetic mobility models which have been developed to date. Second, we study the various mobility traces which have been collected and analyzed. Third, we study how mobility parameters affect the performance of MON. Finally, we highlight on some of the research areas and open challenges which yet remain unsolved.

Analysing social behaviour and message dissemination in human based delay tolerant network

Abstract Recent advances in mobile communication shows proliferation in networks formed by human carried devices known as the pocket switched network (PSN). Human beings are social animals. They tend to form groups and communities, and have repetitive mobility pattern which can be used to disseminate information in PSNs. In this paper, we give a deeper insight to the nature of community formation and how such information can be used to help opportunistic forwarding in mobile opportunistic networks. Using real world mobility traces, we first derive the adjacency list for each node and form the contact graph. Using tools from social network analysis we then determine various node properties like centrality and clustering coefficient and graph properties like average path length and modularity. Based on the derived graph properties, node encounter process and nature of message dissemination in PSNs, we propose two social based routing, known as the contact based routing and community aware two-hop routing. We compare the proposed routing techniques with generic epidemic and prophet routing and Bubble-Rap, a social based routing. Results show that the proposed algorithms is able to achieve better delivery ratio and lower delay than Bubble Rap, while reducing the high overhead ratio of epidemic and prophet routing.

Improving network performance with affinity based mobility model in opportunistic network

Opportunistic network is a type of Delay Tolerant Network which is characterized by intermittent connectivity amongst the nodes and communication largely depends upon the mobility of the participating nodes. The network being highly dynamic, traditional MANET protocols cannot be applied and the nodes must adhere to store-carry-forward mechanism. Nodes do not have the information about the network topology, number of participating nodes and the location of the destination node. Hence, message transfer reliability largely depends upon the mobility pattern of the nodes. In this paper we have tried to find the impact of RWP (Random Waypoint) mobility on packet delivery ratio. We estimate mobility factors like number of node encounters, contact duration(link time) and inter-contact time which in turn depends upon parameters like playfield area (total network area), number of nodes, node velocity, bit-rate and RF range of the nodes. We also propose a restricted form of RWP mobility model, called the affinity based mobility model. The network scenario consists of a source and a destination node that are located at two extreme corners of the square playfield (to keep a maximum distance between them) and exchange data packets with the aid of mobile ‘helper’ nodes. The source node and the destination node are static. The mobile nodes only help in relaying the message. We prove how affinity based mobility model helps in augmenting the network reliability thereby increasing the message delivery ratio and reduce message delivery latency.

Estimators for global information in mobile opportunistic network

Lack of global knowledge in a delay tolerant network proves detrimental, for a replication based routing strategy, in terms of resource utilization. It has often been noticed that nodes keep on replicating a message although it has already been delivered to the destination since such information remains unknown to most of the nodes in the network. Moreover recovery mechanisms (like VACCINE for epidemic routing) take time to propagate and incur additional transmission overhead. Global information such as number of nodes in the network, node meeting schedule, and whether a message has already been delivered to the destination is vital for optimal network performance. In this paper we propose model for estimating some of these vital information and show that replication based routing algorithm like epidemic routing, can perform better with minimum resource utilization. First, we use a uniformly minimum variance unbiased estimator (UMVUE) to estimate the number of nodes in the network. Second, we estimate the number of replicas of any given message in the network, at any given instant (t). Third, we show that epidemic routing with a node population of N can perform best with only N/2 message replicas for any given message and that further replication only leads additional overhead without any performance improvement. We show the simulated results using random waypoint mobility model and Shanghai taxi trace.

Delay-overhead trade-offs in mobile opportunistic network using TTL based restricted flooding

This paper deals with the delay-overhead trade-offs which can be achieved by restricting packet replication in mobile opportunistic networks, a special class of store-carry-forward network. In this regard we propose a TTL based Restricted Flooding Algorithm where each node is allowed to spread fixed number of message replicas at specified time intervals based on the time-to-live of the message. This overcomes high packet overhead ratio of unrestricted flooding while maintaining a comparable packet delivery ratio. By theoretically analyzing the scheme, we provide an upper bound of delivery delay and provide an estimate for number of message replicas which leads to minimum delay. Using theoretical framework we also show that the scheme is scalable and delay approaches a constant value when relative transmission overhead (i.e., transmissions/message) between restricted TTL scheme and the optimal scheme is kept constant. We discuss the performance of the proposed scheme with respect to delivery ratio, overhead ratio and delay and compare it with some of the well-known opportunistic routing algorithms like epidemic, spray-and-wait and prophet.

Information gradient based content search architecture for mobile opportunistic network

Mobile opportunistic network provides a platform for information dissemination and content search, especially in a disaster management scenario, when there is no end-to-end reliable connection or the entire infrastructure based network is severed. In this paper we propose an architecture for content search in mobile opportunistic network, based on information gradient and query forward with the aim to minimize search time and transmission overhead. We know that in a highly dynamic network, the cost and time required to fetch information increases as the Euclidean distance from the object increases. The concept of information gradient helps in minimizing this cost, even if we are away from the source of information. Our content search protocol has three phases, viz. query submit, query forward, and query response phase. We propose a game theory based query forward strategy to maximize throughput and minimize transmission overhead. Simulation results show the performance improvement of game-theoretic approach against simple flooding.

Secured Dynamic Scheduling Algorithm for Real-Time Applications on Grid

The Secured Dynamic Scheduling Algorithm (SDSA) for Real-Time Applications on Grid can enhance the QoS as well as the security aspect of the packets for real-time applications or cyber-physical systems. The existing scheduling algorithms for hard real-time applications are based on timing constraints and security requirements. Some of them provide only authentication security service for the hard real-time application and perform best only when the arrival rate of packets is low. Performance, however, degrades when packet arrival rate increases since they tend to focus only on security aspects and not on scheduling. This paper tries to solve the above problems by using the secured dynamic scheduling algorithm for real-time applications on the grid. Since maintaining the desired security level may hamper the timely delivery of packets, SDSA tries to ensure guaranteed delivery with optimum security using grid or computing elements (CEs). As new packets arrive at the node, the packets are checked for feasibility criteria. A packet not satisfying feasibility criteria is forwarded to the adjacent node having least accepted queue length and again checked for feasibility criteria. Comparing with some of the existing algorithms in this area, SDSA performs well with respect to guaranteeing ratio (GR) and average security level (ASL).

A fundamental traffic management strategy for mobile opportunistic network

Mobile opportunistic networks are characterized by intermittent connectivity and practically no end-to-end connection. In these kinds of network, network capacity and throughput largely depends packet replication. As a result buffer space tends to quickly deplete which may result in severe data loss due to packet drop. To the best of our knowledge, the two important phenomenon of traffic management viz., jitter and packet loss have evaded the minds of researchers in this field and hence we study the problem of buffer management and packet scheduling in such networks. We propose a fair queue scheduling policy where packets are sorted based on total waiting time, i.e. sum of waiting times over all the previous hops, before being transferred over a network link. We analytically prove that scheduling packet transmission as above reduces overall waiting time which leads to lower delay. We also propose a source initiated congestion aware buffer management scheme which helps in reducing number of packet loss significantly. The proposed scheduling and buffer management policy is simulated using real world (Cambridge iMote traces) datasets and compared with other existing scheduling policies. Results show that that proposed scheme has lower delay and lower packet drop compared to other scheduling schemes.

Utilization Based Secured Dynamic Scheduling Algorithm for Real-Time Applications on Grid (U-SDSA)

Security is the major issue in most of the real-time applications, besides there being a stringent requirementfor such applications to provide high QoS. As security algorithmsdemand large computation time, the prevalent real-time packetscheduling algorithms tend to focus on meeting the deadlinewithout having much concern for security requirements. In thispaper, we propose a utilization based secured dynamic schedulingalgorithm (u-SDSA) for real-time applications on grid whichtries to meet both (security and scheduling) the above-mentioned requirements. Using grid of nodes or computing elements asthe distributed framework for processing real-time packets, wetry to ensure maximum guarantee ratio, maximum averagesecurity level, and optimal overall performance. To ensure optimaloverall performance of the grid, our mechanism distributes theincoming packets for processing amongst different nodes basedon utilization of the nodes. If the minimum security level of anincoming packet cannot be ensured, then it is forwarded to oneof the adjacent nodes having the least utilization, provided theutilization of this node is less than the utilization threshold value(U_thresh). Using extensive simulation, we show that the proposedu-SDSA algorithm performs better than the existing algorithms.