-
[show abstract]
[hide abstract]
ABSTRACT: An important challenge confronted in distributed systems is the adoption of suitable and efficient algorithms for coordinator election. The main role of an elected coordinator is to manage the use of a shared resource in an optimal manner. Among all the algorithms reported in the literature, the Bully and Ring algorithms have gained more popularity. In this paper, we describe novel approaches towards improving the Bully and Ring algorithms and also propose the heap tree mechanism for electing the coordinator. The higher efficiency and better performance of our presented algorithms with respect to the existing algorithms is validated through extensive simulation results.
Computer Engineering and Technology (ICCET), 2010 2nd International Conference on; 05/2010
-
[show abstract]
[hide abstract]
ABSTRACT: In this paper, we propose two methods for improve the AODV protocol. A new multipath routing protocol that uses all discovered path simultaneously for transmitting data, by using this approach data packets are balanced over discovered paths and energy consumption is distributed across many nodes through network. Also we proposed a stability estimation method and applied that in an optimized version of ad hoc on-demand distance vector (AODV) routing algorithm by doing some modification at RAODV algorithm. In our algorithm namely Modified Reverse Ad Hoc On-demand Vector (MRAODV), the route request packet didn't change and it is like as AODV, but rout reply packet must be changed for route stability estimation purpose. By doing this we applied link stability in RAODV for decrease overhead of discovery and maintenance of routing. Our protocol also increased the packet delivery ratio in mobile ad hoc networks.
Electronic Devices, Systems and Applications (ICEDSA), 2010 Intl Conf on; 05/2010
-
[show abstract]
[hide abstract]
ABSTRACT: Guaranteeing quality of real-time services in wireless sensor networks (WSN) requires efficient resource management, especially for energy resources. This is due to the fact that nodes in such networks usually use limited non-replaceable batteries. On the other hand, the nodes of WSNs often work in harsh environments, and therefore, susceptible to failure occurrences due to environmental affects or exhaustion of their battery. In this paper, we present a dynamic energy efficient real-time job allocation algorithm called ERTJA for handling node failures in a cluster. ERTJA tries to minimize the energy consumption of the cluster by minimum activation of sleeping nodes while guaranteeing the QoS of the application assigned to the cluster at the same previous level. Further, when the number of sleeping nodes is limited, the proposed algorithm uses the idle times of active nodes to have a graceful QoS degradation of the cluster upon node failure. Simulation results show significant performance improvements of ERTJA in terms of energy consumption comparing to the N-EDF-Plus algorithm. According to the results, ERTJA can save up to 26.5% of the cluster's energy consumption with respect to N-EDF-Plus in the studied scenarios.
Embedded and Multimedia Computing, 2009. EM-Com 2009. 4th International Conference on; 01/2010
-
[show abstract]
[hide abstract]
ABSTRACT: Wireless networks are poised to support a myriad of existing as well as emerging multimedia streaming applications. With increase in use of wireless local area networks (WLANs), ranging from simple data transfer to bandwidth-intense, delay-sensitive, and loss-tolerant multimedia applications, issues regarding quality of service (QoS) have become a major research endeavor. Several challenges posed by robust video streaming over 802.11 WLANs include coping with packet losses caused by network buffer overflow, link erasures, or deadline misses. A major observation is that the retry limit settings of the MAC layer can be optimized in a way such that the overall packet loss caused by link erasure, buffer overflow, or deadline miss is minimized. In this paper, we propose a novel solution for minimizing packet loss in multimedia applications over WLANs. Simulation results justify the improved quality of the received video based on our proposed approach.
Computer Conference, 2009. CSICC 2009. 14th International CSI; 11/2009
-
[show abstract]
[hide abstract]
ABSTRACT: The research community has recently witnessed the emergence of densely deployed wireless sensor networks (WSNs) consisting of a large number of battery-operated sensor nodes. As a candidate for monitoring remote faulty regions, WSNs may suffer from hardware and software faults which may cause misbehavior of a portion of network. Geographic routing algorithms aims at traversing data packets in such environments with admissible communication complexity. In this paper, we propose a novel region routing algorithm that addresses message loss tolerability in harsh and hostile environments by assigning higher weights to higher harsh regions. Finally, we present extensive simulation experiments to validate the accuracy of the proposed algorithm.
Consumer Communications and Networking Conference, 2009. CCNC 2009. 6th IEEE; 02/2009
-
[show abstract]
[hide abstract]
ABSTRACT: In Wireless Sensor Networks maintaining complete coverage over an area is one of the fundamental problems. The network must be able to provide the requested coverage while maximizing the network lifetime through scheduling sleep for extraneous nodes. The network should also be able to configure itself to provide different levels of coverage for different applications. In this paper we present DyKCo, a probabilistic method to provide dynamic k-coverage on the area of an event. Our proposed method creates 1-coverage on the whole sensing area and creates k-coverage on the area of a detected event. Our simulations show that we can achieve very high energy savings and high coverage which result in longer network lifetime and higher accuracy. Due to probabilistic nature of our approach it needs much less communication than similar methods to provide k-coverage.
Systems, Man and Cybernetics, 2008. SMC 2008. IEEE International Conference on; 11/2008
-
[show abstract]
[hide abstract]
ABSTRACT: Wireless sensor networks which are consisted of limited sensing, processing and communication equipments have prominent role in nowadays real-life applications. Efficient robust routing is a key feature in information processing in wireless sensor networks, especially in the presence of high-loss regions which occur due to harsh environment, hardware or software faults. In this paper, we propose a novel routing algorithm for high loss regions which have message loss above a given threshold. We solve theoretically the problem of near-optimal routing in a weighted region. Furthermore, Simulation experiments confirm the validity of proposed algorithm with high degree of accuracy.
Telecommunications, 2008. IST 2008. International Symposium on; 09/2008
