Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection
For ¥0.57 per day, unlimited downloads CREATE MEMBERSHIP Download

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

Neighbor Discovery in Multi-hop Wireless Networks: Evaluation and Dimensioning with Interferences Considerations

Author:
Elyes Ben Hamida  Guillaume Chelius  Anthony Busson  Eric Fleury  


Journal:
Discrete Mathematics & Theoretical Computer Science


Abstract(summary):

Neighbor discovery in multi-hop wireless networks: evaluation and dimensioning with interferences considerations. HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau recherche, publiés ou non, ´ emanant desétablissements d'enseignement et de recherche français oú etrangers, des laboratoires publics ou privés. Neighbor discovery in multi-hop wireless networks: evaluation and dimensioning with interference considerations † In this paper, we study the impact of collisions and interference on a neighbor discovery process in the context of multi-hop wireless networks. We consider three models in which interference and collisions are handled in very different ways. From an ideal channel where simultaneous transmissions do not interfere, we derive an alternate channel where simultaneous transmissions are considered two-by-two under the form of collisions, to finally reach a more realistic channel where simultaneous transmissions are handled under the form of shot-noise interference. In these models, we analytically compute the link probability success between two neighbors as well as the expected number of nodes that correctly receive a Hello packet. Using this analysis, we show that if the neighbor discovery process is asymptotically equivalent in the three models, it offers very different behaviors locally in time. In particular, the scalability of the process is not the same depending on the way interference is handled. Finally, we apply our results to the dimensioning of a Hello protocol parameters. We propose a method to adapt the protocol parameters to meet application constraints on the neighbor discovery process and to minimize the protocol energy consumption.


VIEW PDF

The preview is over

If you wish to continue, please create your membership or download this.

Create Membership

Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads