Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
Routing in Vehicular Ad hoc Networks (VANETs) has found significant attention because of its unique features such as lack of energy constraints and high-speed vehicles applications. Besides, since these networks are highly dynamic, design process of routing algorithms suitable for an urban environment is extremely challenging. Appropriate algorithms could be opportunistic routing (OR) where traffic transmission is performed using the store-carry-forward mechanism. An efficient OR mechanism, called Location and Direction Aware Opportunistic Routing (LDAOR), is proposed in this paper. It is based on the best neighbor node selection by using vehicles positions, vehicles directions, and prioritization of messages from buffers, based on contact histories and positions of neighbor nodes to destination. In LDAOR, when multiple nodes make contact with a carrier node, the closest neighbor node to destination is selected as the best forwarder. However, when only one node makes contact with the carrier node, the message is delivered to it if it moves toward the destination. Using the ONE simulator, the obtained performance evaluation results show that the LDAOR operates better than conventional OR algorithms. The LDAOR not only increases delivery rate, but also reduces network overhead, traffic loss, and number of aborted messages.
EN
The efficiency of cellular networks can be improved in various aspects such as energy consumption, network capacity and interference between neighboring cells. This paper proposes a high capacity energy efficient scheme (HCEE) for data transmission in cellular networks in a country area. In this paper, the authors obtain a new equation to characterize the minimal required output power for traffic transmission between a base station (BS) and a mobile user (MU) based on the MU distance from the BS. Also, the cells boundaries (the boundary of overlapping areas of neighboring cells) by two static and dynamic approaches are specified. This work helps for better frequency allocation to MUs and allows increasing network capacity. In this paper, the analytical modeling in order to formulate the HCEE algorithm and evaluate its performance is used. The performance evaluation results show the simplicity of the HCEE algorithm and its effect on energy consumption decline, network capacity enhancement and the interference reduction.
EN
Reducing the traffic volume of location updating is a critical issue for tracking mobile users in a cellular network. Besides, when user x wants to communicate with user y, the location of user y must be extracted from databases. Therefore, one or more databases must be accessed for updating, recording, deleting, and searching. Thus, the most important criterion of a location tracking algorithm is to provide a small database access time. In this paper, we propose a new location tracking scheme, called Virtual Overlap Region with Forwarding Pointer (VF), and compare the number of database accesses required for updating, deleting, and searching operations for the proposed scheme and other approaches proposed for cellular networks. Our VF scheme like Overlap Region scheme reduces the updating information when a user frequently moves in boundaries of LAs. Unlike Overlap Region, the VF can reduce number of database accesses for searching users' information.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.