Results 111 to 120 of about 1,225 (207)
Selfish Behavior and Compact Representation in Routing and Information Networks [PDF]
, 2015 We study modern networks, focusing on two main such classes of problems, namely problems that arise due to the selfish nature of the network users, and problems concerning the representation of such networks in systems’ level.
Παπακωνσταντινοπούλου Αικατερίνη
core
Review on Security Issues and Applications of Trust Mechanism in Wireless Sensor Networks. [PDF]
Comput Intell Neurosci, 2022 Xia Z, Wei Z, Zhang H.
europepmc +1 more source
A traveler-centric mobility game: Efficiency and stability under rationality and prospect theory. [PDF]
PLoS One, 2023 Chremos IV, Malikopoulos AA.
europepmc +1 more source
, 2008 A wealth of research proposals in ad hoc networks has been seen on the problem of routing along power efficient paths. However they do not take into account the interests of individual nodes.
Jianfeng Cai
core
Satellite Network Security Routing Technology Based on Deep Learning and Trust Management. [PDF]
Sensors (Basel), 2023 Liu Z, Rong J, Jiang Y, Zhang L.
europepmc +1 more source
Novel Scoring for Energy-Efficient Routing in Multi-Sensored Networks. [PDF]
Sensors (Basel), 2022 Kim W, Umar MM, Khan S, Khan MA.
europepmc +1 more source
, 2013 Routing in delay tolerant networks (DTN) adopts the store-carry-forward mode, and it requires nodes to forward data in a cooperative way. However, nodes may be not willing to help others in many applications and this behavior can be called as individual ...
Deng, Yiqi +3 more
core
A cluster-based trusted routing method using fire hawk optimizer (FHO) in wireless sensor networks (WSNs). [PDF]
Sci Rep, 2023 Hosseinzadeh M +8 more
europepmc +1 more source
Selfish yet Optimal Routing by Adjusting Perceived Traffic Information of Road Networks
Traffic congestion in urban areas causes economic and time loss. Such traffic congestion is caused by selfish routing where users aim to minimize their own travel time.
Hara, Takanori +2 more
core
, 2010 在本論文中, 我們定義並研究了一種新的自私路由模型。在原來的模型中, 我們被給予一個網路, 以及欲流過此網路的交通流量。模型中的交通流量是由非常多的使用者所聚集起來的, 而且這些使用者不會彼此合作, 每個使用者都想找出能通過這個網路時間最短的路徑。在這個情況下, 根據賽局理論, 這些使用者流過網路的方式最終會達到一個平衡點, 稱為「納什平衡點」; 然而, 這個平衡點的系統效能會比套用最佳解時的系統效能為差。但我們觀察到, 若使交通流量能套用常見的「優先權」觀念, 使得某些使用者在移動時能感受到較短的時間,
林世鵬, Lin, Shih-Peng
core