آی اس آی پیپر

دانلود رایکان مقاله انگلیسی ISI با موضوع ساختار خود سازمان یافته برای مدیریت تحرک در شبکه های بی سیم

عنوان فارسی مقاله:

ساختار خود سازمان یافته برای مدیریت تحرک در شبکه های بی سیم

عنوان انگلیسی مقاله:

A self-organized structure for mobility management in wireless networks

دانلود رایگان مقاله ISI با فرمت PDF:

مشاهده توضیحات کامل و خرید ترجمه فارسی با فرمت ورد تایپ شده:

بخشی از مقاله انگلیسی :

3. Proposed work: SH approach

3.1. Protocol description

Let V be the vertices set and E be the set of edges (communication links). Then the network graph is denoted as G = (V,E). Each node i 2 V has its own position coordinates and identity (idi). Edges between two nodes i and j are represented as i ? j or j ? i 2 E and the distance between them is denoted as d(i,j). Initially, every node broadcasts its possible parameters (node degree, link bandwidth, etc.) to its one-hop neighbour. Upon receiving broadcast messages from other nodes, every node keeps track of its neighbours and their strength, storing the estimated distance for each of them. After all the initial messages have been sent, every node in the network knows its neighbour’s strength. The strength of the neighbour is the time-varying function and it should be maintained throughout the information exchange process. To achieve this, SH (SH) nodes are identified between source and destination pairs. Given this information, every node computes its neighbour’s parameter list, Sp (source parameters) and broadcasts this information. By exchanging neighbour parameters, SH nodes are able to determine which one is suitable for communication. At the end of the protocol execution, SHp (SH node parameters) contains only eligible neighbours parameters ‘p’ in the final topology and ‘p’ is set to the minimum value needed to reach the farthest node in Dp (destination parameter). This value can be measured by either the received signal strength or distance, or alternate paths to the farthest node in G.