View the profiles of people named Leila Baccouche. Join Facebook to connect with Leila Baccouche and others you may know. Facebook gives people the. Leila Baccouche of University of Carthage, Carthage (UCAR) with expertise in: Computer Security and Reliability and Computer Communications (Networks). Followers, Following, Posts – See Instagram photos and videos from Leila Baccouche (@leila_baccouche).
|Published (Last):||1 September 2005|
|PDF File Size:||14.25 Mb|
|ePub File Size:||20.21 Mb|
|Price:||Free* [*Free Regsitration Required]|
VTLS Chameleon iPortal Format complet
Each intermediate mobile node verifies if the route response packet RREP respects or not the real-time constraint before reaching the source node. Users should refer to the original published version of the material for the full abstract. Therefore, the early death of mobile nodes due to energy exhaustion may lead to the network partitioning baccoiche hence the disruption of service.
However, the workload of real-time applications is unpredictable which may lead bacouche DOI: NI ; Multiagent Systems cs. Each packet is bytes in size.
W equation is calculated in the same manner as . The route selection should be done according to baccocuhe and more queuing information, in terms of queue length and local processing time of each previous flow, too.
The selected route should satisfy delay requirements, preserve energy consumption and avoid liela intermediate mobile nodes. Then, we expose the related works in quality of service routing protocols. The route selection criteria are relative to the application requirements specified by the weighting factors.
NI ; Cryptography and Security cs. MANET covers a large range of applications such as military operations where common wired infrastructures are not directly reachable to provide communication due to limited provision of this facility in those settlements. Click here to sign up.
Dynamic Routing with Security Considerations. However, with DSR, the real-time constraint is not guaranteed especially baccouhe the packet rate value increases. The main differences between ED-DSR and other on-demand routing protocols is that ED-DSR allows the real-time data flows to be routed from the source to the destination before the expiration delay.
Networking and Internet Architecture authors/titles Dec
Then, we observe the behaviour of the mobile nodes. Each simulation runs for s. The CRC Press, In future works, we plan to study the case of unreliable networks in which the nodes can be broken leilla quickly. Skip to main content. In route selection, the source mobile node selects the shortest route among the discovered routes.
It discovers routes between two nodes only when required which reduces the number of control packets. More remaining energy and shorter distance indicate less.
In fact, the delay aware ED-DSR2 and the default ED- DSR3 routing protocol discards the packets that have missed their deadlines in order to reduce the network load with inutile traffic and selects route minimizing energy cost. Instance-based XML data binding for mobile devices.
The proposed solution includes i an energy and delay aware routing protocol and ii a cross-layer service selection protocol, ensuring both timeliness and energy efficiency by avoiding low-power and busy service provider nodes. The main problem is to choose the QoS aware routing protocol to route real-time data with respect to their deadlines within MANET constraints.
It verifies the real-time constraint validity otherwise it discards real-time packets missing their deadlines; thus, it reduces network load and energy consumption of intermediate mobile nodes.
Therefore, we opt to DSR as based protocol in our work. The ED-DSR is monitored especially for firm real-time deadline constraint where the expiration delay is 15s. NI ; Information Theory cs.
This abstract may be abridged. DSR is based on three phases: They are integrated into the cost function used in route selection phase. In route request, the source mobile node discovers routes to the destination node.