فهرس المقالات Meisam Kamarei


  • المقاله

    1 - An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
    Journal of Advances in Computer Research , العدد 1 , السنة 8 , زمستان 2017
    This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition af أکثر
    This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor nodes. However, packet broadcasting leads to increase in the network congestion as well as the network energy consumption. In this regard, this paper proposes an efficient routing algorithm to control number of packets broadcasting. The proposed algorithm declares the mobile data collector new location to sensor nodes within a special area. Special area has been considered around of the mobile data collector. Therefore, the proposed routing algorithm does not permit packets reaching to this special area. Indeed, the proposed algorithm directs data toward the mobile data collector by boundary sensor nodes. In fact, the proposed algorithm considers sensor nodes within special area have more traffic and energy consumption than other sensor nodes. Simulation results that have been implemented in ns-2 show the proposed algorithm increases the network lifetime as well as the sensor nodes energy consumption balancing. تفاصيل المقالة

  • المقاله

    2 - An Efficient Fault-Tolerance Routing Algorithm for Mobile Ad-hoc Networks
    Journal of Advances in Computer Research , العدد 2 , السنة 7 , بهار 2016
    In this paper, an efficient fault-tolerant routing algorithm for Mobile Ad-hoc Networks (MANETs) is presented. The proposed algorithm increases the network fault-tolerance using natural redundancy of Ad-hoc networks. This algorithm is carried out in two stages; 1) the s أکثر
    In this paper, an efficient fault-tolerant routing algorithm for Mobile Ad-hoc Networks (MANETs) is presented. The proposed algorithm increases the network fault-tolerance using natural redundancy of Ad-hoc networks. This algorithm is carried out in two stages; 1) the selection of backup nodes 2) the selection of backup route(s). In the first stage, the proposed algorithm chooses nodes with the same path as backup nodes. Prediction and diagnosis of nodes` paths is performed through backup tables. Since the selection of backup nodes is fulfilled, the proposed algorithm begins fault-tolerance routing. For this purpose, initially the proposed algorithm provides the main route between each pair of source & destination nodes based on DSR routing algorithm. Then, from a destination node towards a source node, the backup route(s) is established between the chosen backup nodes in the first stage. Experimental results taken from NS-2 simulator demonstrate that in comparison with previous methods the proposed increases; 1) 10% the package delivery ratio against the percentages of faulty nodes and, 2) 22% package delivery ratio against the pause time of various mobile nodes. تفاصيل المقالة