Search for: neighboring-nodes
Article Proceedings - 17th IEEE International Conference on Computational Science and Engineering, CSE 2014, Jointly with 13th IEEE International Conference on Ubiquitous Computing and Communications, IUCC 2014, 13th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2014 and 8th International Conference on Frontier of Computer Science and Technology, FCST 2014, 19 December 2014 through 21 December 2014 ; 2015 , Pages 1644-1647 ; 9781479979813 (ISBN) ; Mackvandi, A ; Taghavi, M ; Zare Bidoki, M ; Ghasemi, M ; Neshati, A ; Liu, X ; El Baz, D ; Kang, K ; Hsu, C. H ; Chen, W ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc 2015
MANET, which stands for Mobile Ad-hoc Network, is composed of a group of self-organized and wireless nodes that do not possess any predictable and fixed infrastructure. When nodes want to communicate with each other, they have to pass on their messages directly or indirectly. In case the destination node is out of the transmission range, the source node has to rely on intermediate nodes, which, in this case, is called indirect transmission. On the other hand, if the destination node is the neighboring node, there is no need to employ intermediate nodes, which, in this case, is called direct transmission. Over the past years, security issues in MANETs have received a great deal of attention...
Dynamic link/frequency selection in multi-hop cognitive radio networks for delay sensitive applications, Article ICT 2010: 2010 17th International Conference on Telecommunications, 4 April 2010 through 7 April 2010 ; April , 2010 , Pages 128-132 ; 9781424452477 (ISBN) ; Tadaion, A. A ; Ashtiani, F ; Sharif University of Technology
Regarding the dynamic nature of cognitive radio networks and the delay of the central decision algorithms due to collecting necessary information in a multi-hop wireless network, distributed resource allocation algorithms are of crucial importance. In this paper we propose a new distributed resource allocation algorithm that properly selects link/frequency in a multi-hop cognitive radio network for delay sensitive applications. This algorithm, uses the locally collected information from neighboring nodes to make suitable routing decisions regarding the dynamic environment and the behavior of the neighbors. We consider the delay as the routing criterion, consisting the queueing delay and the...
Article 2009 Second ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM 2009, Sanya, 8 August 2009 through 9 August 2009 ; Volume 4 , 2009 , Pages 644-646 ; 9781424442461 (ISBN) ; Barati, A ; Movaghar, A ; Yangzhou University; Guangdong University of Business Studies; Wuhan Institute of Technology; IEEE SMC TC on Education Technology and Training; IEEE Technology Management Council ; Sharif University of Technology
This paper presents a centralized fault detection algorithm for wireless sensor networks. Faulty sensor nodes are identified based on comparisons between neighboring nodes and own central node and dissemination of the decision made at each node. RNS system is used to tolerate transient faults in sensing and communication. In this system, arithmetic operations act on residues - reminder of dividing original number in several definite modules - in parallel. Consequently computations on these residues which are smaller than the original number are performed, so speed up arithmetic and decreased power consumption is achieved. ©2009 IEEE
Article Proceedings - 2009 3rd International Conference on Sensor Technologies and Applications, SENSORCOMM 2009, 18 June 2009 through 23 June 2009, Athens, Glyfada ; 2009 , Pages 588-595 ; 9780769536699 (ISBN) ; Ghasemi, S ; Sharif University of Technology
In this paper, an approach for topology control has been proposed which make use of distance estimation and angle of arrival (AoA) estimation techniques. Every node in the network tries to keep the number of its neighbors to 4 or 3. These neighbors have been selected from the nearest neighbors of each node and are located in different four quarters of axis. The angular difference between these neighbors is between a minimum and maximum value. This protocol guarantees connectivity on the communication graph with high probability and enforces symmetry on the resulting communication graph, thereby easing the operation of higher level protocols. The performance of the protocol when nodes are...
Article 22nd International Symposium on Computer and Information Sciences, ISCIS 2007, Ankara, 7 November 2007 through 9 November 2007 ; 2007 , Pages 408-412 ; 1424413648 (ISBN); 9781424413645 (ISBN) ; Nayebi, A ; Sarbazi Azad, H ; Sharif University of Technology
Currently, some coarse measures like global network latency are used to compare routing protocols. These measures do not provide enough insight of traffic distribution among network nodes in the presence of different fault regions. This paper presents a detailed traffic analysis of fault-tolerant planar adaptive routing (FTPAR) algorithm achieved by an especially developed tool. Per-node traffic analysis illustrates the traffic hotspots caused by fault regions and provides a great assistance in developing fault tolerant routing algorithms. Based on such detailed information, a simple yet effective improvement of FTPAR is suggested. Moreover, the effect of a traffic hotspot on the traffic of...
Mobility aware distributed topology control in mobile ad-hoc networks with model based adaptive mobility prediction, Article 3rd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2007, White Plains, NY, 8 October 2007 through 10 October 2007 ; 2007 , Pages 86- ; 0769528899 (ISBN); 9780769528892 (ISBN) ; Rabiee, H. R ; Moshref, M ; Dabirmoghaddam, A ; Sharif University of Technology
IEEE Computer Society 2007
Topology control in mobile ad-hoc networks allows better spatial reuse of the wireless channel and control over network resources. Topology control algorithms tend to optimize network power usage by keeping the topology connected. However, few efforts have focused on the issue of topology control with mobility. One of the most efficient mobility aware topology control protocols is the "Mobility Aware Distributed Topology Control Protocol". The major problem with this protocol is the future distance predictor which uses mobility prediction to estimate the future distance of neighboring nodes. The efficiency of this estimator varies in presence of different mobility models, sampling rates and...
Article 3rd International Symposium on Wireless Communication Systems 2006, ISWCS'06, Valencia, 5 September 2006 through 8 September 2006 ; 2006 , Pages 601-604 ; 1424403979 (ISBN); 9781424403974 (ISBN) ; Sharif University of Technology
In ad hoc wireless networks, there are scenarios where the desired destination is located in the range of other transmitters, so that the efforts on setting up communication with this terminal will fail due to collisions that may occur between transmitted control frames and undesired received control and data frames. This phenomenon becomes a bottleneck when most of data transmissions experience packet fragmentation. In such scenarios, the desired destination becomes unreachable during the data transfer of neighboring nodes. Using the same PHY of IEEE 802.11 and making slight modifications in its MAC, a new medium access control scheme equipped by a novel transmission scheduling algorithm is...
Article IEEE Transactions on Network Science and Engineering ; Volume 8, Issue 1 , 2021 , Pages 662-679 ; 23274697 (ISSN) ; Gharib, M ; Rezaei, S ; Trivedi, K. S ; Movaghar, A ; Sharif University of Technology
IEEE Computer Society 2021
As multi-hop wireless networks are attracting more attention, the need to evaluate their performance becomes essential. In order to evaluate the performance metrics of multi-hop wireless networks, including sending and receiving rates of a node as well as the collision probability, a model based on Stochastic Reward Nets (SRNs) is proposed. The proposed SRN models a typical node in such networks, considered as a general template to be applied to any wireless node. The SRN model of a single node is designed to take transmission effects of all neighboring nodes into account, while ignoring the ones whose transmission has no effect on the node under-study. Applying the proposed SRN to each node...
Article IEEE Communications Letters ; Volume 25, Issue 6 , 2021 , Pages 1853-1856 ; 10897798 (ISSN) ; Haghighi, A. M ; Bagheri, N ; Marvasti, F ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc 2021
In a distributed algorithm several processing nodes communicate with each other and incorporate in order to reach a common goal. Each unit has its own locally-observed environment while it can either help or mislead other units when sharing its information. This could be either intentional or simply due to the observation noise. Previous works mainly focus on locating the agents properly and assigning weights based on stationary environment in order to minimize the impact of noisy nodes. We, however, propose a method capable of assigning combination weights in accordance with momentary performance of the neighboring nodes. In order to demonstrate this capability, the proposed algorithm has...